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.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label41_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 12:49:22,359 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 12:49:22,361 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 12:49:22,373 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 12:49:22,373 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 12:49:22,374 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 12:49:22,375 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 12:49:22,377 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 12:49:22,379 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 12:49:22,380 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 12:49:22,381 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 12:49:22,381 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 12:49:22,382 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 12:49:22,383 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 12:49:22,384 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 12:49:22,385 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 12:49:22,386 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 12:49:22,388 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 12:49:22,390 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 12:49:22,391 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 12:49:22,393 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 12:49:22,394 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 12:49:22,396 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 12:49:22,397 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 12:49:22,397 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 12:49:22,398 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 12:49:22,399 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 12:49:22,400 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 12:49:22,401 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 12:49:22,402 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 12:49:22,402 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 12:49:22,403 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 12:49:22,403 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 12:49:22,403 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 12:49:22,404 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 12:49:22,405 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 12:49:22,405 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.epf [2018-11-07 12:49:22,421 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 12:49:22,421 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 12:49:22,422 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 12:49:22,422 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 12:49:22,422 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 12:49:22,422 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 12:49:22,423 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 12:49:22,423 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 12:49:22,423 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 12:49:22,423 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 12:49:22,423 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 12:49:22,424 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 12:49:22,424 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 12:49:22,425 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 12:49:22,425 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 12:49:22,425 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 12:49:22,425 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 12:49:22,425 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 12:49:22,426 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 12:49:22,426 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 12:49:22,426 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 12:49:22,426 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 12:49:22,426 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 12:49:22,426 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 12:49:22,427 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 12:49:22,427 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 12:49:22,427 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 12:49:22,427 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 12:49:22,427 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 12:49:22,428 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 12:49:22,428 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 12:49:22,428 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 12:49:22,428 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 12:49:22,428 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 12:49:22,482 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 12:49:22,496 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 12:49:22,500 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 12:49:22,502 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 12:49:22,502 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 12:49:22,503 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label41_true-unreach-call_false-termination.c [2018-11-07 12:49:22,558 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fe594a07/9c0ab21532ba4ddbbf99f8c0f8a61a5c/FLAGe896a4358 [2018-11-07 12:49:23,183 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 12:49:23,184 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label41_true-unreach-call_false-termination.c [2018-11-07 12:49:23,196 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fe594a07/9c0ab21532ba4ddbbf99f8c0f8a61a5c/FLAGe896a4358 [2018-11-07 12:49:23,211 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fe594a07/9c0ab21532ba4ddbbf99f8c0f8a61a5c [2018-11-07 12:49:23,222 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 12:49:23,223 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 12:49:23,225 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 12:49:23,225 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 12:49:23,229 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 12:49:23,230 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:49:23" (1/1) ... [2018-11-07 12:49:23,232 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a57074e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:49:23, skipping insertion in model container [2018-11-07 12:49:23,233 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:49:23" (1/1) ... [2018-11-07 12:49:23,243 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 12:49:23,295 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 12:49:23,766 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 12:49:23,779 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 12:49:23,906 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 12:49:23,923 INFO L193 MainTranslator]: Completed translation [2018-11-07 12:49:23,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:49:23 WrapperNode [2018-11-07 12:49:23,924 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 12:49:23,925 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 12:49:23,925 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 12:49:23,925 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 12:49:23,935 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:49:23" (1/1) ... [2018-11-07 12:49:24,041 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:49:23" (1/1) ... [2018-11-07 12:49:24,049 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 12:49:24,049 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 12:49:24,050 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 12:49:24,050 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 12:49:24,062 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:49:23" (1/1) ... [2018-11-07 12:49:24,062 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:49:23" (1/1) ... [2018-11-07 12:49:24,067 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:49:23" (1/1) ... [2018-11-07 12:49:24,068 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:49:23" (1/1) ... [2018-11-07 12:49:24,119 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:49:23" (1/1) ... [2018-11-07 12:49:24,144 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:49:23" (1/1) ... [2018-11-07 12:49:24,157 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:49:23" (1/1) ... [2018-11-07 12:49:24,165 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 12:49:24,166 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 12:49:24,166 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 12:49:24,166 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 12:49:24,167 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:49:23" (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-07 12:49:24,237 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 12:49:24,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 12:49:24,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 12:49:24,239 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 12:49:24,239 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 12:49:24,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 12:49:24,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 12:49:24,240 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 12:49:24,240 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 12:49:27,487 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 12:49:27,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:49:27 BoogieIcfgContainer [2018-11-07 12:49:27,488 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 12:49:27,489 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 12:49:27,490 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 12:49:27,493 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 12:49:27,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:49:23" (1/3) ... [2018-11-07 12:49:27,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@750107e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:49:27, skipping insertion in model container [2018-11-07 12:49:27,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:49:23" (2/3) ... [2018-11-07 12:49:27,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@750107e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:49:27, skipping insertion in model container [2018-11-07 12:49:27,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:49:27" (3/3) ... [2018-11-07 12:49:27,497 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label41_true-unreach-call_false-termination.c [2018-11-07 12:49:27,508 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 12:49:27,517 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 12:49:27,537 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 12:49:27,577 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 12:49:27,578 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 12:49:27,578 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 12:49:27,578 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 12:49:27,578 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 12:49:27,579 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 12:49:27,579 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 12:49:27,579 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 12:49:27,606 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-11-07 12:49:27,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-07 12:49:27,619 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:49:27,621 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:49:27,623 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:49:27,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:49:27,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1784134456, now seen corresponding path program 1 times [2018-11-07 12:49:27,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:49:27,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:49:27,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:49:27,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:49:27,693 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:49:27,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:49:28,301 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 12:49:28,432 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-07 12:49:28,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:49:28,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 12:49:28,436 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:49:28,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 12:49:28,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 12:49:28,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 12:49:28,462 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-11-07 12:49:29,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:49:29,979 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-11-07 12:49:29,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 12:49:29,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2018-11-07 12:49:29,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:49:30,004 INFO L225 Difference]: With dead ends: 550 [2018-11-07 12:49:30,006 INFO L226 Difference]: Without dead ends: 340 [2018-11-07 12:49:30,013 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 12:49:30,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-11-07 12:49:30,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-11-07 12:49:30,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-11-07 12:49:30,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 562 transitions. [2018-11-07 12:49:30,120 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 562 transitions. Word has length 92 [2018-11-07 12:49:30,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:49:30,121 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 562 transitions. [2018-11-07 12:49:30,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 12:49:30,122 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 562 transitions. [2018-11-07 12:49:30,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-07 12:49:30,131 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:49:30,131 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:49:30,132 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:49:30,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:49:30,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1017763991, now seen corresponding path program 1 times [2018-11-07 12:49:30,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:49:30,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:49:30,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:49:30,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:49:30,138 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:49:30,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:49:30,406 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 12:49:30,487 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:49:30,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:49:30,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 12:49:30,488 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:49:30,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 12:49:30,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 12:49:30,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 12:49:30,492 INFO L87 Difference]: Start difference. First operand 340 states and 562 transitions. Second operand 6 states. [2018-11-07 12:49:32,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:49:32,524 INFO L93 Difference]: Finished difference Result 888 states and 1491 transitions. [2018-11-07 12:49:32,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 12:49:32,524 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 103 [2018-11-07 12:49:32,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:49:32,531 INFO L225 Difference]: With dead ends: 888 [2018-11-07 12:49:32,531 INFO L226 Difference]: Without dead ends: 554 [2018-11-07 12:49:32,538 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 12:49:32,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-11-07 12:49:32,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 539. [2018-11-07 12:49:32,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-11-07 12:49:32,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 827 transitions. [2018-11-07 12:49:32,584 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 827 transitions. Word has length 103 [2018-11-07 12:49:32,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:49:32,584 INFO L480 AbstractCegarLoop]: Abstraction has 539 states and 827 transitions. [2018-11-07 12:49:32,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 12:49:32,585 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 827 transitions. [2018-11-07 12:49:32,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-07 12:49:32,589 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:49:32,589 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:49:32,589 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:49:32,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:49:32,590 INFO L82 PathProgramCache]: Analyzing trace with hash 869358827, now seen corresponding path program 1 times [2018-11-07 12:49:32,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:49:32,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:49:32,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:49:32,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:49:32,592 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:49:32,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:49:32,771 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:49:32,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:49:32,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 12:49:32,772 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:49:32,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 12:49:32,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 12:49:32,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 12:49:32,776 INFO L87 Difference]: Start difference. First operand 539 states and 827 transitions. Second operand 3 states. [2018-11-07 12:49:33,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:49:33,928 INFO L93 Difference]: Finished difference Result 1530 states and 2432 transitions. [2018-11-07 12:49:33,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 12:49:33,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2018-11-07 12:49:33,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:49:33,947 INFO L225 Difference]: With dead ends: 1530 [2018-11-07 12:49:33,947 INFO L226 Difference]: Without dead ends: 997 [2018-11-07 12:49:33,951 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 12:49:33,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2018-11-07 12:49:33,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 997. [2018-11-07 12:49:33,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2018-11-07 12:49:33,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1488 transitions. [2018-11-07 12:49:33,998 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1488 transitions. Word has length 104 [2018-11-07 12:49:33,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:49:33,999 INFO L480 AbstractCegarLoop]: Abstraction has 997 states and 1488 transitions. [2018-11-07 12:49:34,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 12:49:34,000 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1488 transitions. [2018-11-07 12:49:34,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-07 12:49:34,007 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:49:34,010 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 12:49:34,010 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:49:34,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:49:34,011 INFO L82 PathProgramCache]: Analyzing trace with hash -58190001, now seen corresponding path program 1 times [2018-11-07 12:49:34,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:49:34,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:49:34,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:49:34,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:49:34,012 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:49:34,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:49:34,305 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 12:49:34,703 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:49:34,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:49:34,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 12:49:34,704 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:49:34,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 12:49:34,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 12:49:34,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 12:49:34,705 INFO L87 Difference]: Start difference. First operand 997 states and 1488 transitions. Second operand 6 states. [2018-11-07 12:49:37,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:49:37,717 INFO L93 Difference]: Finished difference Result 2927 states and 4616 transitions. [2018-11-07 12:49:37,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 12:49:37,720 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 118 [2018-11-07 12:49:37,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:49:37,743 INFO L225 Difference]: With dead ends: 2927 [2018-11-07 12:49:37,744 INFO L226 Difference]: Without dead ends: 1936 [2018-11-07 12:49:37,751 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 12:49:37,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1936 states. [2018-11-07 12:49:37,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1936 to 1881. [2018-11-07 12:49:37,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1881 states. [2018-11-07 12:49:37,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1881 states to 1881 states and 2656 transitions. [2018-11-07 12:49:37,836 INFO L78 Accepts]: Start accepts. Automaton has 1881 states and 2656 transitions. Word has length 118 [2018-11-07 12:49:37,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:49:37,836 INFO L480 AbstractCegarLoop]: Abstraction has 1881 states and 2656 transitions. [2018-11-07 12:49:37,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 12:49:37,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 2656 transitions. [2018-11-07 12:49:37,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-07 12:49:37,845 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:49:37,846 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 12:49:37,846 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:49:37,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:49:37,847 INFO L82 PathProgramCache]: Analyzing trace with hash -2017463946, now seen corresponding path program 1 times [2018-11-07 12:49:37,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:49:37,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:49:37,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:49:37,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:49:37,848 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:49:37,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:49:38,102 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 48 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:49:38,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:49:38,102 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:49:38,103 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 137 with the following transitions: [2018-11-07 12:49:38,105 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [17], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [373], [375], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:49:38,151 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:49:38,151 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:49:42,445 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:49:42,447 INFO L272 AbstractInterpreter]: Visited 96 different actions 161 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-07 12:49:42,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:49:42,498 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:49:44,002 INFO L227 lantSequenceWeakener]: Weakened 133 states. On average, predicates are now at 80.02% of their original sizes. [2018-11-07 12:49:44,002 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:49:44,455 INFO L415 sIntCurrentIteration]: We unified 135 AI predicates to 135 [2018-11-07 12:49:44,456 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:49:44,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:49:44,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-11-07 12:49:44,457 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:49:44,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 12:49:44,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 12:49:44,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-07 12:49:44,459 INFO L87 Difference]: Start difference. First operand 1881 states and 2656 transitions. Second operand 11 states. [2018-11-07 12:49:59,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:49:59,776 INFO L93 Difference]: Finished difference Result 4979 states and 7062 transitions. [2018-11-07 12:49:59,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 12:49:59,776 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 136 [2018-11-07 12:49:59,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:49:59,795 INFO L225 Difference]: With dead ends: 4979 [2018-11-07 12:49:59,796 INFO L226 Difference]: Without dead ends: 3104 [2018-11-07 12:49:59,805 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 146 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2018-11-07 12:49:59,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3104 states. [2018-11-07 12:49:59,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3104 to 3071. [2018-11-07 12:49:59,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3071 states. [2018-11-07 12:49:59,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3071 states to 3071 states and 3991 transitions. [2018-11-07 12:49:59,900 INFO L78 Accepts]: Start accepts. Automaton has 3071 states and 3991 transitions. Word has length 136 [2018-11-07 12:49:59,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:49:59,901 INFO L480 AbstractCegarLoop]: Abstraction has 3071 states and 3991 transitions. [2018-11-07 12:49:59,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 12:49:59,902 INFO L276 IsEmpty]: Start isEmpty. Operand 3071 states and 3991 transitions. [2018-11-07 12:49:59,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-07 12:49:59,911 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:49:59,911 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:49:59,912 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:49:59,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:49:59,912 INFO L82 PathProgramCache]: Analyzing trace with hash -970438447, now seen corresponding path program 1 times [2018-11-07 12:49:59,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:49:59,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:49:59,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:49:59,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:49:59,914 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:49:59,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:50:00,124 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 60 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-07 12:50:00,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:50:00,125 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:50:00,125 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 150 with the following transitions: [2018-11-07 12:50:00,125 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [373], [375], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:50:00,130 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:50:00,130 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:50:01,532 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:50:01,533 INFO L272 AbstractInterpreter]: Visited 97 different actions 164 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-07 12:50:01,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:50:01,562 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:50:03,153 INFO L227 lantSequenceWeakener]: Weakened 58 states. On average, predicates are now at 80.6% of their original sizes. [2018-11-07 12:50:03,153 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:50:03,823 INFO L415 sIntCurrentIteration]: We unified 148 AI predicates to 148 [2018-11-07 12:50:03,823 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:50:03,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:50:03,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [6] total 23 [2018-11-07 12:50:03,824 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:50:03,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 12:50:03,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 12:50:03,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-11-07 12:50:03,826 INFO L87 Difference]: Start difference. First operand 3071 states and 3991 transitions. Second operand 19 states. [2018-11-07 12:50:27,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:50:27,568 INFO L93 Difference]: Finished difference Result 6421 states and 8375 transitions. [2018-11-07 12:50:27,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 12:50:27,568 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 149 [2018-11-07 12:50:27,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:50:27,584 INFO L225 Difference]: With dead ends: 6421 [2018-11-07 12:50:27,584 INFO L226 Difference]: Without dead ends: 3492 [2018-11-07 12:50:27,595 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 160 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=207, Invalid=723, Unknown=0, NotChecked=0, Total=930 [2018-11-07 12:50:27,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3492 states. [2018-11-07 12:50:27,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3492 to 3482. [2018-11-07 12:50:27,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3482 states. [2018-11-07 12:50:27,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3482 states to 3482 states and 4444 transitions. [2018-11-07 12:50:27,685 INFO L78 Accepts]: Start accepts. Automaton has 3482 states and 4444 transitions. Word has length 149 [2018-11-07 12:50:27,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:50:27,685 INFO L480 AbstractCegarLoop]: Abstraction has 3482 states and 4444 transitions. [2018-11-07 12:50:27,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 12:50:27,686 INFO L276 IsEmpty]: Start isEmpty. Operand 3482 states and 4444 transitions. [2018-11-07 12:50:27,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-07 12:50:27,694 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:50:27,694 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:50:27,695 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:50:27,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:50:27,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1340018050, now seen corresponding path program 1 times [2018-11-07 12:50:27,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:50:27,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:50:27,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:50:27,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:50:27,696 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:50:27,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:50:27,960 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 74 proven. 14 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 12:50:27,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:50:27,960 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:50:27,961 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 162 with the following transitions: [2018-11-07 12:50:27,961 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [17], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [373], [375], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:50:27,967 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:50:27,967 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:50:30,785 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 12:50:30,785 INFO L272 AbstractInterpreter]: Visited 99 different actions 269 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 12:50:30,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:50:30,790 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 12:50:30,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:50:30,790 INFO L194 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-07 12:50:30,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:50:30,800 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 12:50:30,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:50:30,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 12:50:31,375 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 62 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 12:50:31,376 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 12:50:32,362 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 74 proven. 14 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 12:50:32,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 12:50:32,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2018-11-07 12:50:32,400 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 12:50:32,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 12:50:32,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 12:50:32,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-07 12:50:32,402 INFO L87 Difference]: Start difference. First operand 3482 states and 4444 transitions. Second operand 8 states. [2018-11-07 12:50:33,072 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 12:50:35,844 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 12:50:38,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:50:38,696 INFO L93 Difference]: Finished difference Result 12383 states and 17508 transitions. [2018-11-07 12:50:38,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 12:50:38,704 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 161 [2018-11-07 12:50:38,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:50:38,739 INFO L225 Difference]: With dead ends: 12383 [2018-11-07 12:50:38,739 INFO L226 Difference]: Without dead ends: 6865 [2018-11-07 12:50:38,782 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=215, Invalid=777, Unknown=0, NotChecked=0, Total=992 [2018-11-07 12:50:38,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6865 states. [2018-11-07 12:50:38,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6865 to 6710. [2018-11-07 12:50:38,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6710 states. [2018-11-07 12:50:38,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6710 states to 6710 states and 8088 transitions. [2018-11-07 12:50:38,982 INFO L78 Accepts]: Start accepts. Automaton has 6710 states and 8088 transitions. Word has length 161 [2018-11-07 12:50:38,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:50:38,982 INFO L480 AbstractCegarLoop]: Abstraction has 6710 states and 8088 transitions. [2018-11-07 12:50:38,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 12:50:38,982 INFO L276 IsEmpty]: Start isEmpty. Operand 6710 states and 8088 transitions. [2018-11-07 12:50:39,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-07 12:50:39,002 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:50:39,002 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:50:39,002 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:50:39,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:50:39,003 INFO L82 PathProgramCache]: Analyzing trace with hash -684471189, now seen corresponding path program 1 times [2018-11-07 12:50:39,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:50:39,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:50:39,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:50:39,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:50:39,005 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:50:39,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:50:39,488 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 107 proven. 49 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 12:50:39,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:50:39,489 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:50:39,489 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 203 with the following transitions: [2018-11-07 12:50:39,489 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [205], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [373], [375], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:50:39,494 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:50:39,494 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:50:44,921 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 12:50:44,921 INFO L272 AbstractInterpreter]: Visited 98 different actions 361 times. Merged at 8 different actions 29 times. Never widened. Found 7 fixpoints after 2 different actions. Largest state had 42 variables. [2018-11-07 12:50:44,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:50:44,926 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 12:50:44,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:50:44,926 INFO L194 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-07 12:50:44,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:50:44,936 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 12:50:45,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:50:45,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 12:50:45,154 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 102 proven. 2 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-07 12:50:45,154 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 12:50:45,907 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 113 proven. 8 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 12:50:45,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 12:50:45,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2018-11-07 12:50:45,932 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 12:50:45,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 12:50:45,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 12:50:45,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-11-07 12:50:45,933 INFO L87 Difference]: Start difference. First operand 6710 states and 8088 transitions. Second operand 12 states. [2018-11-07 12:50:52,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:50:52,539 INFO L93 Difference]: Finished difference Result 25025 states and 33491 transitions. [2018-11-07 12:50:52,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-07 12:50:52,541 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 202 [2018-11-07 12:50:52,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:50:52,541 INFO L225 Difference]: With dead ends: 25025 [2018-11-07 12:50:52,541 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 12:50:52,627 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 435 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 638 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=479, Invalid=1873, Unknown=0, NotChecked=0, Total=2352 [2018-11-07 12:50:52,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 12:50:52,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 12:50:52,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 12:50:52,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 12:50:52,629 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 202 [2018-11-07 12:50:52,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:50:52,629 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 12:50:52,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 12:50:52,630 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 12:50:52,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 12:50:52,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 12:50:53,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:53,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:53,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:53,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:53,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:53,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:53,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:53,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:53,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:53,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:53,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:53,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:53,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:53,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:53,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:53,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:53,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:53,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:53,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:53,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:53,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:53,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:53,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:53,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:53,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:53,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:53,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:53,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:53,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:53,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:53,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:53,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:53,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:53,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:53,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:53,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:53,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:53,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:53,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:53,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:53,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:53,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:53,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:53,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:53,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:53,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:53,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:53,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:53,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:53,975 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:53,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:54,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:54,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:54,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:54,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:54,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:54,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:54,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:54,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:54,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:54,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:54,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:54,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:54,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:54,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:54,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:54,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:54,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:54,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:54,533 WARN L179 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 496 DAG size of output: 364 [2018-11-07 12:50:54,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:54,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:54,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:54,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:54,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:54,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:54,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:54,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:54,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:54,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:54,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:54,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:54,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:54,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:54,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:54,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:54,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:54,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:54,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:54,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:54,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:54,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:54,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:54,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:55,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:55,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:55,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:55,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:55,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:55,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:55,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:55,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:55,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:55,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:55,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:55,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:55,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:55,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:55,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:55,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:55,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:55,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:55,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:55,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:55,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:55,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:55,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:55,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:55,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:55,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:55,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:55,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:55,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:55,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:55,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:55,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:55,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:55,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:55,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:55,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:55,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:55,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:55,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:55,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:55,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:55,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:55,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:55,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:55,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:55,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:55,749 WARN L179 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 475 DAG size of output: 342 [2018-11-07 12:50:55,920 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2018-11-07 12:50:56,407 WARN L179 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 86 [2018-11-07 12:50:58,473 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 476 DAG size of output: 89 [2018-11-07 12:51:01,064 WARN L179 SmtUtils]: Spent 2.57 s on a formula simplification. DAG size of input: 384 DAG size of output: 98 [2018-11-07 12:51:02,962 WARN L179 SmtUtils]: Spent 1.89 s on a formula simplification. DAG size of input: 366 DAG size of output: 98 [2018-11-07 12:51:02,966 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 12:51:02,966 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a7~0 |old(~a7~0)|) (= |old(~a8~0)| ~a8~0) (= |old(~a20~0)| ~a20~0) (= ~a17~0 |old(~a17~0)|) (= |old(~a16~0)| ~a16~0)) [2018-11-07 12:51:02,966 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 12:51:02,967 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-11-07 12:51:02,967 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-11-07 12:51:02,967 INFO L425 ceAbstractionStarter]: For program point L565(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,967 INFO L425 ceAbstractionStarter]: For program point L532(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,967 INFO L425 ceAbstractionStarter]: For program point L499(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,967 INFO L425 ceAbstractionStarter]: For program point L466(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,967 INFO L425 ceAbstractionStarter]: For program point L433(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,967 INFO L425 ceAbstractionStarter]: For program point L400(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,968 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-11-07 12:51:02,968 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-11-07 12:51:02,968 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-11-07 12:51:02,968 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-11-07 12:51:02,968 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-11-07 12:51:02,968 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-11-07 12:51:02,968 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-11-07 12:51:02,968 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-11-07 12:51:02,968 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-11-07 12:51:02,968 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 431) no Hoare annotation was computed. [2018-11-07 12:51:02,968 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-11-07 12:51:02,969 INFO L425 ceAbstractionStarter]: For program point L568(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,969 INFO L425 ceAbstractionStarter]: For program point L535(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,969 INFO L425 ceAbstractionStarter]: For program point L502(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,969 INFO L425 ceAbstractionStarter]: For program point L469(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,969 INFO L425 ceAbstractionStarter]: For program point L436(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,969 INFO L425 ceAbstractionStarter]: For program point L403(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,969 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-11-07 12:51:02,969 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-11-07 12:51:02,969 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-11-07 12:51:02,969 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-11-07 12:51:02,969 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-11-07 12:51:02,969 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-11-07 12:51:02,969 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-11-07 12:51:02,969 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-11-07 12:51:02,970 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-11-07 12:51:02,970 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-11-07 12:51:02,970 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-11-07 12:51:02,970 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-11-07 12:51:02,970 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-11-07 12:51:02,970 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-11-07 12:51:02,970 INFO L425 ceAbstractionStarter]: For program point L571(lines 571 573) no Hoare annotation was computed. [2018-11-07 12:51:02,970 INFO L425 ceAbstractionStarter]: For program point L538(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,970 INFO L425 ceAbstractionStarter]: For program point L505(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,970 INFO L425 ceAbstractionStarter]: For program point L472(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,970 INFO L425 ceAbstractionStarter]: For program point L439(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,970 INFO L425 ceAbstractionStarter]: For program point L406(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,970 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-11-07 12:51:02,971 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-11-07 12:51:02,971 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-11-07 12:51:02,971 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-11-07 12:51:02,971 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-11-07 12:51:02,971 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-11-07 12:51:02,971 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-11-07 12:51:02,971 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-11-07 12:51:02,971 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-11-07 12:51:02,971 INFO L425 ceAbstractionStarter]: For program point L541(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,971 INFO L425 ceAbstractionStarter]: For program point L508(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,971 INFO L425 ceAbstractionStarter]: For program point L475(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,971 INFO L425 ceAbstractionStarter]: For program point L442(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,972 INFO L425 ceAbstractionStarter]: For program point L409(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,972 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-11-07 12:51:02,972 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-11-07 12:51:02,972 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-11-07 12:51:02,972 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-11-07 12:51:02,972 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-11-07 12:51:02,972 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-11-07 12:51:02,972 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-11-07 12:51:02,972 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-11-07 12:51:02,972 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-11-07 12:51:02,973 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-11-07 12:51:02,973 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-11-07 12:51:02,973 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-11-07 12:51:02,973 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-11-07 12:51:02,973 INFO L425 ceAbstractionStarter]: For program point L544(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,973 INFO L425 ceAbstractionStarter]: For program point L511(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,973 INFO L425 ceAbstractionStarter]: For program point L478(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,973 INFO L425 ceAbstractionStarter]: For program point L445(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,973 INFO L425 ceAbstractionStarter]: For program point L412(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,974 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-11-07 12:51:02,974 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-11-07 12:51:02,974 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-11-07 12:51:02,974 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-11-07 12:51:02,974 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-11-07 12:51:02,974 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-11-07 12:51:02,974 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-11-07 12:51:02,974 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-11-07 12:51:02,975 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-11-07 12:51:02,975 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,975 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,975 INFO L425 ceAbstractionStarter]: For program point L547(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,975 INFO L425 ceAbstractionStarter]: For program point L514(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,975 INFO L425 ceAbstractionStarter]: For program point L481(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,975 INFO L425 ceAbstractionStarter]: For program point L448(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,975 INFO L425 ceAbstractionStarter]: For program point L415(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,976 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-11-07 12:51:02,976 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-11-07 12:51:02,976 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-11-07 12:51:02,976 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-11-07 12:51:02,976 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-11-07 12:51:02,976 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-11-07 12:51:02,976 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-11-07 12:51:02,976 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-11-07 12:51:02,976 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-11-07 12:51:02,976 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-11-07 12:51:02,977 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-11-07 12:51:02,977 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-11-07 12:51:02,977 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-11-07 12:51:02,977 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-11-07 12:51:02,977 INFO L425 ceAbstractionStarter]: For program point L550(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,977 INFO L425 ceAbstractionStarter]: For program point L517(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,977 INFO L425 ceAbstractionStarter]: For program point L484(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,977 INFO L425 ceAbstractionStarter]: For program point L451(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,977 INFO L425 ceAbstractionStarter]: For program point L418(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,978 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-11-07 12:51:02,978 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-11-07 12:51:02,978 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-11-07 12:51:02,978 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-11-07 12:51:02,978 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-11-07 12:51:02,978 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-11-07 12:51:02,978 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-11-07 12:51:02,978 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-11-07 12:51:02,978 INFO L425 ceAbstractionStarter]: For program point L553(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,979 INFO L425 ceAbstractionStarter]: For program point L520(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,979 INFO L425 ceAbstractionStarter]: For program point L487(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,979 INFO L425 ceAbstractionStarter]: For program point L454(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,979 INFO L425 ceAbstractionStarter]: For program point L421(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,979 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-11-07 12:51:02,979 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-11-07 12:51:02,979 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-11-07 12:51:02,979 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-11-07 12:51:02,979 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-11-07 12:51:02,980 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-11-07 12:51:02,980 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-11-07 12:51:02,980 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-11-07 12:51:02,980 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-11-07 12:51:02,980 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-11-07 12:51:02,980 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse14 (= ~a7~0 |old(~a7~0)|)) (.cse12 (= 1 |old(~a17~0)|)) (.cse15 (= |old(~a8~0)| ~a8~0)) (.cse18 (= |old(~a20~0)| ~a20~0)) (.cse19 (= ~a17~0 |old(~a17~0)|)) (.cse16 (= |old(~a16~0)| ~a16~0))) (let ((.cse10 (and (= 1 ~a7~0) .cse15 .cse18 .cse19 .cse16)) (.cse11 (not (= 1 |old(~a7~0)|))) (.cse4 (< 6 |calculate_output_#in~input|)) (.cse0 (not (= 1 |old(~a21~0)|))) (.cse1 (not (= 8 ~a12~0))) (.cse2 (= ~a21~0 1)) (.cse6 (< 1 |old(~a7~0)|)) (.cse7 (< |old(~a7~0)| 0)) (.cse8 (< |calculate_output_#in~input| 1)) (.cse5 (not (= 1 |old(~a20~0)|))) (.cse3 (not .cse12)) (.cse9 (= 6 |old(~a16~0)|)) (.cse17 (= 4 |old(~a16~0)|)) (.cse13 (and .cse14 .cse15 .cse18 .cse19 .cse16))) (and (or (not (= 0 |old(~a7~0)|)) .cse0 .cse1 (< 1 |old(~a20~0)|) .cse2 (< |old(~a20~0)| 0) .cse3 (not (= 15 |old(~a8~0)|)) (not (= 5 |old(~a16~0)|))) (or .cse4 .cse0 .cse1 .cse3 .cse5 .cse6 (= ~a17~0 1) .cse7 .cse8) (or .cse9 .cse10 .cse11) (or .cse9 .cse12 .cse13) (or .cse10 (not (= |old(~a20~0)| 1)) .cse11 (< 0 |old(~a17~0)|)) (or .cse4 .cse0 (< 15 |old(~a8~0)|) .cse1 .cse3 .cse2 .cse5 (< 5 |old(~a16~0)|) (< |old(~a16~0)| 4) .cse6 (< |old(~a8~0)| 13) .cse7 .cse8) (or .cse9 (and .cse14 .cse15 (= 1 ~a20~0) .cse16) .cse5) (or .cse13 .cse17 .cse5 .cse3) (or .cse9 .cse17 (and .cse14 .cse15 .cse16)) (or .cse13 (= 13 |old(~a8~0)|))))) [2018-11-07 12:51:02,981 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-11-07 12:51:02,981 INFO L425 ceAbstractionStarter]: For program point L556(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,981 INFO L425 ceAbstractionStarter]: For program point L523(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,981 INFO L425 ceAbstractionStarter]: For program point L490(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,981 INFO L425 ceAbstractionStarter]: For program point L457(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,981 INFO L425 ceAbstractionStarter]: For program point L424(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,981 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-11-07 12:51:02,981 INFO L425 ceAbstractionStarter]: For program point L391-1(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,981 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-11-07 12:51:02,981 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-11-07 12:51:02,982 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-11-07 12:51:02,982 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-11-07 12:51:02,982 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-11-07 12:51:02,982 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-11-07 12:51:02,982 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-11-07 12:51:02,982 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-11-07 12:51:02,982 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-11-07 12:51:02,982 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-11-07 12:51:02,982 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-11-07 12:51:02,983 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-11-07 12:51:02,983 INFO L425 ceAbstractionStarter]: For program point L559(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,983 INFO L425 ceAbstractionStarter]: For program point L526(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,983 INFO L425 ceAbstractionStarter]: For program point L493(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,983 INFO L425 ceAbstractionStarter]: For program point L460(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,983 INFO L425 ceAbstractionStarter]: For program point L427(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,983 INFO L425 ceAbstractionStarter]: For program point L394(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,983 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-11-07 12:51:02,983 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-11-07 12:51:02,983 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-11-07 12:51:02,984 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-11-07 12:51:02,984 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-11-07 12:51:02,984 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-11-07 12:51:02,984 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-11-07 12:51:02,984 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-11-07 12:51:02,984 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-11-07 12:51:02,984 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-11-07 12:51:02,984 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-11-07 12:51:02,984 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-11-07 12:51:02,985 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-11-07 12:51:02,985 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-11-07 12:51:02,985 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-11-07 12:51:02,985 INFO L425 ceAbstractionStarter]: For program point L562(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,985 INFO L425 ceAbstractionStarter]: For program point L529(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,985 INFO L425 ceAbstractionStarter]: For program point L496(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,985 INFO L425 ceAbstractionStarter]: For program point L463(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,985 INFO L425 ceAbstractionStarter]: For program point L397(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,985 INFO L425 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:02,985 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-11-07 12:51:02,986 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-11-07 12:51:02,986 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-11-07 12:51:02,986 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-11-07 12:51:02,986 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-11-07 12:51:02,986 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-11-07 12:51:02,986 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-11-07 12:51:02,986 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-11-07 12:51:02,986 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-11-07 12:51:02,986 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-11-07 12:51:02,986 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 12:51:02,987 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~d~0 4) (= ~a8~0 15) (= ~z~0 26) (= ~a17~0 1) (= ~c~0 3) (= ~a21~0 1) (= ~f~0 6) (= ~w~0 23) (= ~u~0 21) (= ~v~0 22) (= ~a7~0 0) (= ~y~0 25) (= ~e~0 5) (= ~x~0 24) (= ~b~0 2) (= ~a~0 1) (= ~a12~0 8) (= ~a20~0 1) (= ~a16~0 5)) [2018-11-07 12:51:02,987 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 12:51:02,987 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 12:51:02,987 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (and (= ~a21~0 1) (= ~a16~0 5) (= ~a8~0 15) (= ~a7~0 0) (= ~a17~0 |old(~a17~0)|) (= ~a20~0 1)) (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= |old(~a16~0)| 5)) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (not (= |old(~a7~0)| 0)) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= ~x~0 24)) (not (= |old(~a17~0)| 1)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= |old(~a8~0)| 15)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) [2018-11-07 12:51:02,987 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-11-07 12:51:02,988 INFO L421 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse2 (= ~a7~0 |old(~a7~0)|)) (.cse1 (not (= ~a16~0 4))) (.cse0 (= 1 ~a20~0)) (.cse4 (= 1 ~a7~0)) (.cse3 (not (= ~a16~0 6)))) (or (and .cse0 (= ~a17~0 |old(~a17~0)|) .cse1) (not (= 1 |old(~a21~0)|)) (and .cse2 .cse0 .cse3) (not (= 4 ~d~0)) (not (= ~x~0 24)) (not (= ~e~0 5)) (not (= 22 ~v~0)) (and .cse2 .cse3 .cse1) (not (= ~c~0 3)) (not (= 1 ~a~0)) (not (= 5 |old(~a16~0)|)) (not (= ~u~0 21)) (and .cse4 .cse0 (<= ~a17~0 0)) (not (= |old(~a7~0)| 0)) (not (= ~a8~0 13)) (not (= 26 ~z~0)) (and .cse3 (not (= ~a17~0 1))) (and .cse4 .cse3) (not (= 8 ~a12~0)) (not (= 2 ~b~0)) (not (= 25 ~y~0)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= 15 |old(~a8~0)|)) (not (= |old(~a17~0)| 1)) (not (= 6 ~f~0)))) [2018-11-07 12:51:02,988 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-11-07 12:51:02,988 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-11-07 12:51:02,988 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-11-07 12:51:02,988 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse2 (= ~a7~0 |old(~a7~0)|)) (.cse1 (not (= ~a16~0 4))) (.cse0 (= 1 ~a20~0)) (.cse4 (= 1 ~a7~0)) (.cse3 (not (= ~a16~0 6)))) (or (and .cse0 (= ~a17~0 |old(~a17~0)|) .cse1) (not (= 1 |old(~a21~0)|)) (and .cse2 .cse0 .cse3) (not (= 4 ~d~0)) (not (= ~x~0 24)) (not (= ~e~0 5)) (not (= 22 ~v~0)) (and .cse2 .cse3 .cse1) (not (= ~c~0 3)) (not (= 1 ~a~0)) (not (= 5 |old(~a16~0)|)) (not (= ~u~0 21)) (and .cse4 .cse0 (<= ~a17~0 0)) (not (= |old(~a7~0)| 0)) (not (= ~a8~0 13)) (not (= 26 ~z~0)) (and .cse3 (not (= ~a17~0 1))) (and .cse4 .cse3) (not (= 8 ~a12~0)) (not (= 2 ~b~0)) (not (= 25 ~y~0)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= 15 |old(~a8~0)|)) (not (= |old(~a17~0)| 1)) (not (= 6 ~f~0)))) [2018-11-07 12:51:02,988 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-11-07 12:51:03,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:51:03 BoogieIcfgContainer [2018-11-07 12:51:03,009 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 12:51:03,010 INFO L168 Benchmark]: Toolchain (without parser) took 99787.99 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 3.2 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-11-07 12:51:03,014 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 12:51:03,014 INFO L168 Benchmark]: CACSL2BoogieTranslator took 699.93 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-11-07 12:51:03,015 INFO L168 Benchmark]: Boogie Procedure Inliner took 124.11 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 721.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -811.4 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. [2018-11-07 12:51:03,017 INFO L168 Benchmark]: Boogie Preprocessor took 116.02 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2018-11-07 12:51:03,018 INFO L168 Benchmark]: RCFGBuilder took 3322.72 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 103.8 MB). Peak memory consumption was 103.8 MB. Max. memory is 7.1 GB. [2018-11-07 12:51:03,020 INFO L168 Benchmark]: TraceAbstraction took 95520.02 ms. Allocated memory was 2.2 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 3.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-11-07 12:51:03,026 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 699.93 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 124.11 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 721.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -811.4 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 116.02 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3322.72 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 103.8 MB). Peak memory consumption was 103.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 95520.02 ms. Allocated memory was 2.2 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 3.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 431]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((1 == a20 && a17 == \old(a17)) && !(a16 == 4)) || !(1 == \old(a21))) || ((a7 == \old(a7) && 1 == a20) && !(a16 == 6))) || !(4 == d)) || !(x == 24)) || !(e == 5)) || !(22 == v)) || ((a7 == \old(a7) && !(a16 == 6)) && !(a16 == 4))) || !(c == 3)) || !(1 == a)) || !(5 == \old(a16))) || !(u == 21)) || ((1 == a7 && 1 == a20) && a17 <= 0)) || !(\old(a7) == 0)) || !(a8 == 13)) || !(26 == z)) || (!(a16 == 6) && !(a17 == 1))) || (1 == a7 && !(a16 == 6))) || !(8 == a12)) || !(2 == b)) || !(25 == y)) || !(\old(a20) == 1)) || !(23 == w)) || !(15 == \old(a8))) || !(\old(a17) == 1)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. SAFE Result, 95.4s OverallTime, 8 OverallIterations, 5 TraceHistogramMax, 60.0s AutomataDifference, 0.0s DeadEndRemovalTime, 10.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 1031 SDtfs, 9736 SDslu, 1456 SDs, 0 SdLazy, 12974 SolverSat, 2714 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 32.8s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 1185 GetRequests, 1038 SyntacticMatches, 5 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1103 ImplicationChecksByTransitivity, 6.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6710occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 14.0s AbstIntTime, 4 AbstIntIterations, 2 AbstIntStrong, 0.9966395010690496 AbsIntWeakeningRatio, 0.26855123674911663 AbsIntAvgWeakeningVarsNumRemoved, 25.558303886925795 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 8 MinimizatonAttempts, 268 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 369 PreInvPairs, 897 NumberOfFragments, 742 HoareAnnotationTreeSize, 369 FomulaSimplifications, 24416 FormulaSimplificationTreeSizeReduction, 3.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 26338 FormulaSimplificationTreeSizeReductionInter, 7.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 1428 NumberOfCodeBlocks, 1428 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1779 ConstructedInterpolants, 0 QuantifiedInterpolants, 476810 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1085 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 12 InterpolantComputations, 4 PerfectInterpolantSequences, 921/1027 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...