java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label06_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-27 12:14:56,212 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 12:14:56,217 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 12:14:56,234 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 12:14:56,234 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 12:14:56,237 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 12:14:56,239 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 12:14:56,241 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 12:14:56,243 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 12:14:56,243 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 12:14:56,244 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 12:14:56,245 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 12:14:56,246 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 12:14:56,247 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 12:14:56,249 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 12:14:56,250 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 12:14:56,251 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 12:14:56,255 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 12:14:56,257 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 12:14:56,259 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 12:14:56,260 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 12:14:56,263 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 12:14:56,268 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 12:14:56,268 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 12:14:56,268 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 12:14:56,269 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 12:14:56,270 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 12:14:56,271 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 12:14:56,272 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 12:14:56,273 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 12:14:56,273 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 12:14:56,274 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 12:14:56,276 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 12:14:56,276 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 12:14:56,277 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 12:14:56,278 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 12:14:56,278 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf [2018-10-27 12:14:56,302 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 12:14:56,302 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 12:14:56,304 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 12:14:56,304 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 12:14:56,304 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 12:14:56,304 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 12:14:56,305 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 12:14:56,305 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-27 12:14:56,305 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 12:14:56,306 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-27 12:14:56,306 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 12:14:56,306 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 12:14:56,307 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 12:14:56,307 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 12:14:56,307 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 12:14:56,307 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 12:14:56,307 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 12:14:56,308 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 12:14:56,309 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 12:14:56,309 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 12:14:56,310 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 12:14:56,310 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 12:14:56,310 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 12:14:56,310 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 12:14:56,310 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 12:14:56,311 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 12:14:56,311 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 12:14:56,311 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 12:14:56,311 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 12:14:56,312 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 12:14:56,312 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 12:14:56,312 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 12:14:56,312 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-27 12:14:56,312 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-27 12:14:56,375 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 12:14:56,391 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 12:14:56,395 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 12:14:56,397 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 12:14:56,397 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 12:14:56,398 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label06_true-unreach-call_false-termination.c [2018-10-27 12:14:56,456 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/70e9c54f8/e731d8faa6044745b1436fbf01cd9e62/FLAG2cb25982f [2018-10-27 12:14:57,024 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 12:14:57,025 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label06_true-unreach-call_false-termination.c [2018-10-27 12:14:57,040 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/70e9c54f8/e731d8faa6044745b1436fbf01cd9e62/FLAG2cb25982f [2018-10-27 12:14:57,067 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/70e9c54f8/e731d8faa6044745b1436fbf01cd9e62 [2018-10-27 12:14:57,081 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 12:14:57,082 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 12:14:57,083 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 12:14:57,084 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 12:14:57,087 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 12:14:57,088 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:14:57" (1/1) ... [2018-10-27 12:14:57,091 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b9d0a52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:14:57, skipping insertion in model container [2018-10-27 12:14:57,091 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:14:57" (1/1) ... [2018-10-27 12:14:57,102 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 12:14:57,165 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 12:14:57,625 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 12:14:57,630 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 12:14:57,786 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 12:14:57,805 INFO L193 MainTranslator]: Completed translation [2018-10-27 12:14:57,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:14:57 WrapperNode [2018-10-27 12:14:57,806 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 12:14:57,807 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 12:14:57,807 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 12:14:57,807 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 12:14:57,815 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:14:57" (1/1) ... [2018-10-27 12:14:57,834 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:14:57" (1/1) ... [2018-10-27 12:14:58,020 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 12:14:58,021 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 12:14:58,021 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 12:14:58,022 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 12:14:58,031 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:14:57" (1/1) ... [2018-10-27 12:14:58,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:14:57" (1/1) ... [2018-10-27 12:14:58,036 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:14:57" (1/1) ... [2018-10-27 12:14:58,036 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:14:57" (1/1) ... [2018-10-27 12:14:58,057 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:14:57" (1/1) ... [2018-10-27 12:14:58,079 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:14:57" (1/1) ... [2018-10-27 12:14:58,093 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:14:57" (1/1) ... [2018-10-27 12:14:58,102 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 12:14:58,102 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 12:14:58,102 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 12:14:58,102 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 12:14:58,103 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:14:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 12:14:58,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 12:14:58,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 12:14:58,182 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-27 12:14:58,183 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-27 12:14:58,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 12:14:58,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 12:14:58,183 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 12:14:58,184 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 12:15:01,726 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 12:15:01,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:15:01 BoogieIcfgContainer [2018-10-27 12:15:01,727 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 12:15:01,728 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 12:15:01,728 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 12:15:01,732 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 12:15:01,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 12:14:57" (1/3) ... [2018-10-27 12:15:01,733 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c9f113e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:15:01, skipping insertion in model container [2018-10-27 12:15:01,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:14:57" (2/3) ... [2018-10-27 12:15:01,733 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c9f113e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:15:01, skipping insertion in model container [2018-10-27 12:15:01,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:15:01" (3/3) ... [2018-10-27 12:15:01,736 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label06_true-unreach-call_false-termination.c [2018-10-27 12:15:01,746 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 12:15:01,754 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 12:15:01,772 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 12:15:01,811 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 12:15:01,811 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 12:15:01,811 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 12:15:01,811 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 12:15:01,812 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 12:15:01,812 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 12:15:01,812 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 12:15:01,812 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 12:15:01,839 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-10-27 12:15:01,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-10-27 12:15:01,854 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:15:01,856 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 12:15:01,858 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:15:01,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:15:01,864 INFO L82 PathProgramCache]: Analyzing trace with hash 482475453, now seen corresponding path program 1 times [2018-10-27 12:15:01,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:15:01,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:15:01,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:15:01,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:15:01,917 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:15:02,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:15:02,585 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 12:15:02,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 12:15:02,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 12:15:02,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 12:15:02,768 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:15:02,775 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 12:15:02,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 12:15:02,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 12:15:02,795 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-10-27 12:15:04,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:15:04,344 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-10-27 12:15:04,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 12:15:04,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2018-10-27 12:15:04,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:15:04,366 INFO L225 Difference]: With dead ends: 550 [2018-10-27 12:15:04,366 INFO L226 Difference]: Without dead ends: 340 [2018-10-27 12:15:04,374 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 12:15:04,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-10-27 12:15:04,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-10-27 12:15:04,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-10-27 12:15:04,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 541 transitions. [2018-10-27 12:15:04,461 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 541 transitions. Word has length 131 [2018-10-27 12:15:04,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:15:04,463 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 541 transitions. [2018-10-27 12:15:04,463 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 12:15:04,463 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 541 transitions. [2018-10-27 12:15:04,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-27 12:15:04,469 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:15:04,470 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 12:15:04,470 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:15:04,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:15:04,471 INFO L82 PathProgramCache]: Analyzing trace with hash -359292034, now seen corresponding path program 1 times [2018-10-27 12:15:04,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:15:04,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:15:04,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:15:04,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:15:04,473 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:15:04,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:15:04,750 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 12:15:04,952 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 12:15:04,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 12:15:04,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 12:15:04,953 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:15:04,955 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 12:15:04,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 12:15:04,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 12:15:04,956 INFO L87 Difference]: Start difference. First operand 340 states and 541 transitions. Second operand 6 states. [2018-10-27 12:15:06,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:15:06,703 INFO L93 Difference]: Finished difference Result 1075 states and 1784 transitions. [2018-10-27 12:15:06,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 12:15:06,706 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2018-10-27 12:15:06,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:15:06,719 INFO L225 Difference]: With dead ends: 1075 [2018-10-27 12:15:06,719 INFO L226 Difference]: Without dead ends: 741 [2018-10-27 12:15:06,724 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-27 12:15:06,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2018-10-27 12:15:06,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 724. [2018-10-27 12:15:06,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-10-27 12:15:06,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1120 transitions. [2018-10-27 12:15:06,786 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1120 transitions. Word has length 142 [2018-10-27 12:15:06,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:15:06,786 INFO L481 AbstractCegarLoop]: Abstraction has 724 states and 1120 transitions. [2018-10-27 12:15:06,787 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 12:15:06,787 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1120 transitions. [2018-10-27 12:15:06,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-27 12:15:06,793 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:15:06,793 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 12:15:06,796 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:15:06,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:15:06,796 INFO L82 PathProgramCache]: Analyzing trace with hash -879449942, now seen corresponding path program 1 times [2018-10-27 12:15:06,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:15:06,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:15:06,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:15:06,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:15:06,798 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:15:06,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:15:07,265 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 12:15:07,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 12:15:07,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 12:15:07,266 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:15:07,267 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 12:15:07,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 12:15:07,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 12:15:07,268 INFO L87 Difference]: Start difference. First operand 724 states and 1120 transitions. Second operand 5 states. [2018-10-27 12:15:09,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:15:09,580 INFO L93 Difference]: Finished difference Result 1578 states and 2483 transitions. [2018-10-27 12:15:09,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 12:15:09,581 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2018-10-27 12:15:09,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:15:09,586 INFO L225 Difference]: With dead ends: 1578 [2018-10-27 12:15:09,587 INFO L226 Difference]: Without dead ends: 721 [2018-10-27 12:15:09,590 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 12:15:09,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2018-10-27 12:15:09,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 721. [2018-10-27 12:15:09,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2018-10-27 12:15:09,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 1044 transitions. [2018-10-27 12:15:09,621 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 1044 transitions. Word has length 143 [2018-10-27 12:15:09,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:15:09,622 INFO L481 AbstractCegarLoop]: Abstraction has 721 states and 1044 transitions. [2018-10-27 12:15:09,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 12:15:09,622 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1044 transitions. [2018-10-27 12:15:09,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-27 12:15:09,626 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:15:09,626 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 12:15:09,626 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:15:09,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:15:09,627 INFO L82 PathProgramCache]: Analyzing trace with hash 353210034, now seen corresponding path program 1 times [2018-10-27 12:15:09,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:15:09,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:15:09,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:15:09,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:15:09,629 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:15:09,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:15:09,854 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 12:15:09,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 12:15:09,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 12:15:09,855 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:15:09,856 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 12:15:09,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 12:15:09,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 12:15:09,856 INFO L87 Difference]: Start difference. First operand 721 states and 1044 transitions. Second operand 3 states. [2018-10-27 12:15:11,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:15:11,333 INFO L93 Difference]: Finished difference Result 1871 states and 2749 transitions. [2018-10-27 12:15:11,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 12:15:11,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2018-10-27 12:15:11,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:15:11,350 INFO L225 Difference]: With dead ends: 1871 [2018-10-27 12:15:11,351 INFO L226 Difference]: Without dead ends: 1156 [2018-10-27 12:15:11,355 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 12:15:11,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2018-10-27 12:15:11,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 1153. [2018-10-27 12:15:11,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1153 states. [2018-10-27 12:15:11,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1553 transitions. [2018-10-27 12:15:11,405 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1553 transitions. Word has length 147 [2018-10-27 12:15:11,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:15:11,406 INFO L481 AbstractCegarLoop]: Abstraction has 1153 states and 1553 transitions. [2018-10-27 12:15:11,406 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 12:15:11,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1553 transitions. [2018-10-27 12:15:11,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-10-27 12:15:11,413 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:15:11,414 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 12:15:11,414 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:15:11,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:15:11,414 INFO L82 PathProgramCache]: Analyzing trace with hash -2123069123, now seen corresponding path program 1 times [2018-10-27 12:15:11,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:15:11,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:15:11,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:15:11,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:15:11,416 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:15:11,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:15:11,691 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-27 12:15:11,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 12:15:11,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 12:15:11,692 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:15:11,693 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 12:15:11,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 12:15:11,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 12:15:11,694 INFO L87 Difference]: Start difference. First operand 1153 states and 1553 transitions. Second operand 4 states. [2018-10-27 12:15:13,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:15:13,021 INFO L93 Difference]: Finished difference Result 3973 states and 5595 transitions. [2018-10-27 12:15:13,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 12:15:13,022 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2018-10-27 12:15:13,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:15:13,039 INFO L225 Difference]: With dead ends: 3973 [2018-10-27 12:15:13,039 INFO L226 Difference]: Without dead ends: 2826 [2018-10-27 12:15:13,048 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 12:15:13,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2826 states. [2018-10-27 12:15:13,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2826 to 2796. [2018-10-27 12:15:13,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2796 states. [2018-10-27 12:15:13,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2796 states to 2796 states and 3650 transitions. [2018-10-27 12:15:13,136 INFO L78 Accepts]: Start accepts. Automaton has 2796 states and 3650 transitions. Word has length 168 [2018-10-27 12:15:13,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:15:13,137 INFO L481 AbstractCegarLoop]: Abstraction has 2796 states and 3650 transitions. [2018-10-27 12:15:13,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 12:15:13,137 INFO L276 IsEmpty]: Start isEmpty. Operand 2796 states and 3650 transitions. [2018-10-27 12:15:13,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-27 12:15:13,149 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:15:13,149 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 12:15:13,150 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:15:13,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:15:13,150 INFO L82 PathProgramCache]: Analyzing trace with hash -813161529, now seen corresponding path program 1 times [2018-10-27 12:15:13,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:15:13,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:15:13,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:15:13,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:15:13,152 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:15:13,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:15:13,354 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 56 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 12:15:13,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:15:13,354 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:15:13,355 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 180 with the following transitions: [2018-10-27 12:15:13,357 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [649], [657], [665], [673], [681], [685], [687], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 12:15:13,411 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:15:13,411 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:15:13,951 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 12:15:13,953 INFO L272 AbstractInterpreter]: Visited 69 different actions 69 times. Never merged. Never widened. Never found a fixpoint. Largest state had 42 variables. [2018-10-27 12:15:13,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:15:13,962 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 12:15:14,417 INFO L227 lantSequenceWeakener]: Weakened 107 states. On average, predicates are now at 79.64% of their original sizes. [2018-10-27 12:15:14,417 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 12:15:15,347 INFO L415 sIntCurrentIteration]: We unified 178 AI predicates to 178 [2018-10-27 12:15:15,348 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 12:15:15,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 12:15:15,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 16 [2018-10-27 12:15:15,351 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:15:15,352 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-27 12:15:15,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-27 12:15:15,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-10-27 12:15:15,353 INFO L87 Difference]: Start difference. First operand 2796 states and 3650 transitions. Second operand 12 states. [2018-10-27 12:15:26,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:15:26,458 INFO L93 Difference]: Finished difference Result 5647 states and 7380 transitions. [2018-10-27 12:15:26,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 12:15:26,458 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 179 [2018-10-27 12:15:26,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:15:26,472 INFO L225 Difference]: With dead ends: 5647 [2018-10-27 12:15:26,472 INFO L226 Difference]: Without dead ends: 2857 [2018-10-27 12:15:26,483 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 184 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2018-10-27 12:15:26,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2857 states. [2018-10-27 12:15:26,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2857 to 2857. [2018-10-27 12:15:26,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2857 states. [2018-10-27 12:15:26,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2857 states to 2857 states and 3716 transitions. [2018-10-27 12:15:26,564 INFO L78 Accepts]: Start accepts. Automaton has 2857 states and 3716 transitions. Word has length 179 [2018-10-27 12:15:26,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:15:26,564 INFO L481 AbstractCegarLoop]: Abstraction has 2857 states and 3716 transitions. [2018-10-27 12:15:26,564 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-27 12:15:26,564 INFO L276 IsEmpty]: Start isEmpty. Operand 2857 states and 3716 transitions. [2018-10-27 12:15:26,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-27 12:15:26,576 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:15:26,577 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 12:15:26,577 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:15:26,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:15:26,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1518221820, now seen corresponding path program 1 times [2018-10-27 12:15:26,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:15:26,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:15:26,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:15:26,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:15:26,579 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:15:26,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:15:26,823 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 60 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 12:15:26,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:15:26,824 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:15:26,824 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 189 with the following transitions: [2018-10-27 12:15:26,825 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [649], [657], [665], [673], [681], [685], [687], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 12:15:26,831 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:15:26,832 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:15:27,126 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 12:15:27,127 INFO L272 AbstractInterpreter]: Visited 136 different actions 203 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-27 12:15:27,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:15:27,134 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 12:15:27,609 INFO L227 lantSequenceWeakener]: Weakened 97 states. On average, predicates are now at 81.37% of their original sizes. [2018-10-27 12:15:27,610 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 12:15:28,772 INFO L415 sIntCurrentIteration]: We unified 187 AI predicates to 187 [2018-10-27 12:15:28,773 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 12:15:28,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 12:15:28,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [6] total 23 [2018-10-27 12:15:28,773 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:15:28,774 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-27 12:15:28,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-27 12:15:28,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-10-27 12:15:28,774 INFO L87 Difference]: Start difference. First operand 2857 states and 3716 transitions. Second operand 19 states. [2018-10-27 12:15:41,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:15:41,050 INFO L93 Difference]: Finished difference Result 5932 states and 7727 transitions. [2018-10-27 12:15:41,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-27 12:15:41,050 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 188 [2018-10-27 12:15:41,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:15:41,064 INFO L225 Difference]: With dead ends: 5932 [2018-10-27 12:15:41,064 INFO L226 Difference]: Without dead ends: 3142 [2018-10-27 12:15:41,074 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 199 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=207, Invalid=723, Unknown=0, NotChecked=0, Total=930 [2018-10-27 12:15:41,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3142 states. [2018-10-27 12:15:41,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3142 to 3131. [2018-10-27 12:15:41,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2018-10-27 12:15:41,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 4010 transitions. [2018-10-27 12:15:41,152 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 4010 transitions. Word has length 188 [2018-10-27 12:15:41,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:15:41,153 INFO L481 AbstractCegarLoop]: Abstraction has 3131 states and 4010 transitions. [2018-10-27 12:15:41,153 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-27 12:15:41,153 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 4010 transitions. [2018-10-27 12:15:41,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-10-27 12:15:41,165 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:15:41,165 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 12:15:41,166 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:15:41,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:15:41,166 INFO L82 PathProgramCache]: Analyzing trace with hash 241118704, now seen corresponding path program 1 times [2018-10-27 12:15:41,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:15:41,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:15:41,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:15:41,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:15:41,168 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:15:41,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:15:41,469 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 100 proven. 15 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-27 12:15:41,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:15:41,470 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:15:41,470 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 222 with the following transitions: [2018-10-27 12:15:41,470 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [649], [657], [665], [673], [681], [685], [687], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 12:15:41,475 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:15:41,475 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:15:41,900 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 12:15:41,900 INFO L272 AbstractInterpreter]: Visited 136 different actions 203 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-27 12:15:41,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:15:41,938 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 12:15:42,611 INFO L227 lantSequenceWeakener]: Weakened 120 states. On average, predicates are now at 81.1% of their original sizes. [2018-10-27 12:15:42,612 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 12:15:44,385 INFO L415 sIntCurrentIteration]: We unified 220 AI predicates to 220 [2018-10-27 12:15:44,385 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 12:15:44,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 12:15:44,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [29] imperfect sequences [6] total 33 [2018-10-27 12:15:44,386 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:15:44,386 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-27 12:15:44,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-27 12:15:44,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=646, Unknown=0, NotChecked=0, Total=812 [2018-10-27 12:15:44,387 INFO L87 Difference]: Start difference. First operand 3131 states and 4010 transitions. Second operand 29 states. [2018-10-27 12:15:58,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:15:58,975 INFO L93 Difference]: Finished difference Result 6343 states and 8151 transitions. [2018-10-27 12:15:58,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-27 12:15:58,975 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 221 [2018-10-27 12:15:58,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:15:58,990 INFO L225 Difference]: With dead ends: 6343 [2018-10-27 12:15:58,990 INFO L226 Difference]: Without dead ends: 3553 [2018-10-27 12:15:59,001 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 236 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=438, Invalid=1542, Unknown=0, NotChecked=0, Total=1980 [2018-10-27 12:15:59,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3553 states. [2018-10-27 12:15:59,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3553 to 3405. [2018-10-27 12:15:59,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3405 states. [2018-10-27 12:15:59,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3405 states to 3405 states and 4302 transitions. [2018-10-27 12:15:59,084 INFO L78 Accepts]: Start accepts. Automaton has 3405 states and 4302 transitions. Word has length 221 [2018-10-27 12:15:59,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:15:59,084 INFO L481 AbstractCegarLoop]: Abstraction has 3405 states and 4302 transitions. [2018-10-27 12:15:59,085 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-27 12:15:59,085 INFO L276 IsEmpty]: Start isEmpty. Operand 3405 states and 4302 transitions. [2018-10-27 12:15:59,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-27 12:15:59,097 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:15:59,098 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 12:15:59,098 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:15:59,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:15:59,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1707455469, now seen corresponding path program 1 times [2018-10-27 12:15:59,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:15:59,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:15:59,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:15:59,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:15:59,100 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:15:59,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:15:59,404 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 98 proven. 52 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-27 12:15:59,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:15:59,405 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:15:59,405 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 231 with the following transitions: [2018-10-27 12:15:59,405 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [649], [657], [665], [673], [681], [685], [687], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 12:15:59,409 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:15:59,409 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:16:00,488 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 12:16:00,489 INFO L272 AbstractInterpreter]: Visited 138 different actions 630 times. Merged at 9 different actions 50 times. Widened at 1 different actions 1 times. Found 11 fixpoints after 3 different actions. Largest state had 42 variables. [2018-10-27 12:16:00,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:16:00,502 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 12:16:00,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:16:00,502 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 12:16:00,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:16:00,516 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 12:16:00,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:16:00,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 12:16:01,050 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 116 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-27 12:16:01,050 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 12:16:01,319 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-27 12:16:01,427 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-27 12:16:01,887 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 104 proven. 44 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-27 12:16:01,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 12:16:01,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-10-27 12:16:01,909 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 12:16:01,910 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 12:16:01,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 12:16:01,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-10-27 12:16:01,911 INFO L87 Difference]: Start difference. First operand 3405 states and 4302 transitions. Second operand 11 states. [2018-10-27 12:16:05,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:16:05,455 INFO L93 Difference]: Finished difference Result 7475 states and 9596 transitions. [2018-10-27 12:16:05,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 12:16:05,459 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 230 [2018-10-27 12:16:05,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:16:05,477 INFO L225 Difference]: With dead ends: 7475 [2018-10-27 12:16:05,477 INFO L226 Difference]: Without dead ends: 4411 [2018-10-27 12:16:05,494 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 461 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2018-10-27 12:16:05,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4411 states. [2018-10-27 12:16:05,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4411 to 4133. [2018-10-27 12:16:05,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4133 states. [2018-10-27 12:16:05,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4133 states to 4133 states and 5187 transitions. [2018-10-27 12:16:05,757 INFO L78 Accepts]: Start accepts. Automaton has 4133 states and 5187 transitions. Word has length 230 [2018-10-27 12:16:05,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:16:05,758 INFO L481 AbstractCegarLoop]: Abstraction has 4133 states and 5187 transitions. [2018-10-27 12:16:05,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 12:16:05,758 INFO L276 IsEmpty]: Start isEmpty. Operand 4133 states and 5187 transitions. [2018-10-27 12:16:05,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-27 12:16:05,773 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:16:05,774 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 12:16:05,774 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:16:05,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:16:05,775 INFO L82 PathProgramCache]: Analyzing trace with hash 649665019, now seen corresponding path program 2 times [2018-10-27 12:16:05,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:16:05,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:16:05,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:16:05,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:16:05,776 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:16:05,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:16:06,304 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 98 proven. 54 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-27 12:16:06,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:16:06,304 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:16:06,305 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 12:16:06,305 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 12:16:06,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:16:06,305 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 12:16:06,316 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 12:16:06,316 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 12:16:06,402 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-27 12:16:06,402 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 12:16:06,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 12:16:06,503 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-10-27 12:16:06,503 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 12:16:06,618 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-10-27 12:16:06,639 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 12:16:06,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 10 [2018-10-27 12:16:06,640 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:16:06,640 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 12:16:06,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 12:16:06,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-27 12:16:06,641 INFO L87 Difference]: Start difference. First operand 4133 states and 5187 transitions. Second operand 3 states. [2018-10-27 12:16:07,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:16:07,720 INFO L93 Difference]: Finished difference Result 9294 states and 12009 transitions. [2018-10-27 12:16:07,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 12:16:07,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2018-10-27 12:16:07,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:16:07,722 INFO L225 Difference]: With dead ends: 9294 [2018-10-27 12:16:07,722 INFO L226 Difference]: Without dead ends: 0 [2018-10-27 12:16:07,751 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 459 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-27 12:16:07,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-27 12:16:07,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-27 12:16:07,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-27 12:16:07,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-27 12:16:07,752 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 230 [2018-10-27 12:16:07,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:16:07,756 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 12:16:07,756 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 12:16:07,756 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-27 12:16:07,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-27 12:16:07,761 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-27 12:16:07,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:16:08,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:16:08,125 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 149 [2018-10-27 12:16:08,350 WARN L179 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2018-10-27 12:16:08,818 WARN L179 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 86 [2018-10-27 12:16:10,304 WARN L179 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 276 DAG size of output: 156 [2018-10-27 12:16:10,595 WARN L179 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 91 [2018-10-27 12:16:10,947 WARN L179 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 91 [2018-10-27 12:16:10,950 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-27 12:16:10,950 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a20~0)| ~a20~0) (= |old(~a16~0)| ~a16~0)) [2018-10-27 12:16:10,950 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-27 12:16:10,950 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-10-27 12:16:10,950 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-10-27 12:16:10,951 INFO L425 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,951 INFO L425 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,951 INFO L425 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,951 INFO L425 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,951 INFO L425 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,951 INFO L425 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,951 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-10-27 12:16:10,952 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-10-27 12:16:10,952 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-10-27 12:16:10,952 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-10-27 12:16:10,952 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-10-27 12:16:10,952 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-10-27 12:16:10,952 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-10-27 12:16:10,952 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-10-27 12:16:10,952 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-10-27 12:16:10,952 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-10-27 12:16:10,952 INFO L425 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,952 INFO L425 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,952 INFO L425 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,953 INFO L425 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,953 INFO L425 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,953 INFO L425 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,953 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-10-27 12:16:10,953 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-10-27 12:16:10,953 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-10-27 12:16:10,953 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-10-27 12:16:10,953 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-10-27 12:16:10,953 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-10-27 12:16:10,953 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-10-27 12:16:10,954 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-10-27 12:16:10,954 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-10-27 12:16:10,954 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-10-27 12:16:10,954 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-10-27 12:16:10,954 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-10-27 12:16:10,954 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-10-27 12:16:10,954 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-10-27 12:16:10,954 INFO L425 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2018-10-27 12:16:10,955 INFO L425 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,955 INFO L425 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,955 INFO L425 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,955 INFO L425 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,955 INFO L425 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,955 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-10-27 12:16:10,955 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 548) no Hoare annotation was computed. [2018-10-27 12:16:10,955 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-10-27 12:16:10,956 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-10-27 12:16:10,956 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-10-27 12:16:10,956 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-10-27 12:16:10,956 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-10-27 12:16:10,956 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-10-27 12:16:10,956 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-10-27 12:16:10,956 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-10-27 12:16:10,956 INFO L425 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,957 INFO L425 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,957 INFO L425 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,957 INFO L425 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,957 INFO L425 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,957 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-10-27 12:16:10,957 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-10-27 12:16:10,957 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-10-27 12:16:10,957 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-10-27 12:16:10,957 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-10-27 12:16:10,958 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-10-27 12:16:10,958 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-10-27 12:16:10,958 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-10-27 12:16:10,958 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-10-27 12:16:10,958 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-10-27 12:16:10,958 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-10-27 12:16:10,958 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-10-27 12:16:10,958 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-10-27 12:16:10,958 INFO L425 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,959 INFO L425 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,959 INFO L425 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,959 INFO L425 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,959 INFO L425 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,959 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-10-27 12:16:10,959 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-10-27 12:16:10,959 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-10-27 12:16:10,959 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-10-27 12:16:10,959 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-10-27 12:16:10,960 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-10-27 12:16:10,960 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-10-27 12:16:10,960 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-10-27 12:16:10,960 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-10-27 12:16:10,960 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,960 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,960 INFO L425 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,960 INFO L425 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,961 INFO L425 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,961 INFO L425 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,961 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-10-27 12:16:10,961 INFO L425 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,961 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-10-27 12:16:10,961 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-10-27 12:16:10,961 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-10-27 12:16:10,961 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-10-27 12:16:10,962 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-10-27 12:16:10,962 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-10-27 12:16:10,962 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-10-27 12:16:10,962 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-10-27 12:16:10,962 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-10-27 12:16:10,962 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-10-27 12:16:10,962 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-10-27 12:16:10,962 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-10-27 12:16:10,962 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-10-27 12:16:10,962 INFO L425 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,963 INFO L425 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,963 INFO L425 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,963 INFO L425 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,963 INFO L425 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,963 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-10-27 12:16:10,963 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-10-27 12:16:10,963 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-10-27 12:16:10,963 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-10-27 12:16:10,963 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-10-27 12:16:10,964 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-10-27 12:16:10,964 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-10-27 12:16:10,964 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-10-27 12:16:10,964 INFO L425 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,964 INFO L425 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,964 INFO L425 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,964 INFO L425 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,964 INFO L425 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,964 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-10-27 12:16:10,964 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-10-27 12:16:10,965 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-10-27 12:16:10,965 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-10-27 12:16:10,965 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-10-27 12:16:10,965 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-10-27 12:16:10,965 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-10-27 12:16:10,965 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-10-27 12:16:10,965 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-10-27 12:16:10,965 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-10-27 12:16:10,966 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse12 (= |old(~a20~0)| ~a20~0)) (.cse13 (= |old(~a16~0)| ~a16~0))) (let ((.cse5 (not (= ~a8~0 13))) (.cse6 (= 6 |old(~a16~0)|)) (.cse4 (= 13 |old(~a8~0)|)) (.cse15 (= ~a21~0 1)) (.cse16 (= ~a7~0 0)) (.cse10 (not (= 1 |old(~a21~0)|))) (.cse11 (not (= 1 |old(~a17~0)|))) (.cse0 (not (= 1 |old(~a20~0)|))) (.cse8 (= 1 |old(~a7~0)|)) (.cse1 (not (= 15 |old(~a8~0)|))) (.cse9 (not (= ~a7~0 1))) (.cse3 (= 15 ~a8~0)) (.cse18 (< 4 |old(~a16~0)|)) (.cse19 (and .cse12 .cse13)) (.cse2 (not (= 8 ~a12~0))) (.cse7 (< 0 |old(~a20~0)|)) (.cse17 (= ~a17~0 1)) (.cse14 (not (= 0 |old(~a7~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse4 .cse2 .cse5) (or .cse6 .cse1 .cse2 .cse3 .cse7) (or .cse8 .cse0 .cse2 .cse9) (or .cse10 .cse0 (not (= 4 |old(~a16~0)|)) (and (= 1 ~a7~0) (= 13 ~a8~0) (= 1 ~a21~0) (= 1 ~a17~0)) .cse2 (not .cse8) (not .cse4) .cse11) (or .cse6 (and .cse12 .cse13 .cse5) .cse4 .cse2 .cse7) (or (or .cse14 .cse10 (< 6 |old(~a16~0)|) (< |old(~a16~0)| 5) .cse0 .cse1 (< |old(~a17~0)| 0) .cse2 (< 1 |old(~a17~0)|)) (and (<= 0 ~a17~0) .cse15 (<= ~a17~0 1) .cse16)) (or .cse6 .cse8 .cse4 .cse2 .cse9 .cse7) (or (and .cse17 .cse15 .cse16) (or .cse14 .cse10 .cse1 (not (= 5 |old(~a16~0)|)) .cse2 (< |old(~a20~0)| 0) .cse7 .cse11)) (or .cse8 .cse18 .cse9 .cse2 .cse7) (or .cse0 .cse19 .cse2) (or .cse8 .cse1 .cse2 (and .cse9 .cse12 .cse13 .cse3) .cse7) (or .cse18 .cse19 .cse2 .cse7) (or .cse17 (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (< |calculate_output_#in~input| 1) .cse14 (< 6 |calculate_output_#in~input|) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 1)) (not (= |old(~a8~0)| 15)) (not (= 6 ~f~0)))))) [2018-10-27 12:16:10,966 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-10-27 12:16:10,966 INFO L425 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,966 INFO L425 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,966 INFO L425 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,967 INFO L425 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,967 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-10-27 12:16:10,967 INFO L425 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,967 INFO L425 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,967 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-10-27 12:16:10,967 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-10-27 12:16:10,967 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-10-27 12:16:10,967 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-10-27 12:16:10,967 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-10-27 12:16:10,968 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-10-27 12:16:10,968 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-10-27 12:16:10,968 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-10-27 12:16:10,968 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-10-27 12:16:10,968 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-10-27 12:16:10,968 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-10-27 12:16:10,968 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-10-27 12:16:10,968 INFO L425 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,968 INFO L425 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,968 INFO L425 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,969 INFO L425 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,969 INFO L425 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,969 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-10-27 12:16:10,969 INFO L425 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,969 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-10-27 12:16:10,969 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-10-27 12:16:10,969 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-10-27 12:16:10,969 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-10-27 12:16:10,969 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-10-27 12:16:10,969 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-10-27 12:16:10,970 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-10-27 12:16:10,970 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-10-27 12:16:10,970 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-10-27 12:16:10,970 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-10-27 12:16:10,970 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-10-27 12:16:10,970 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-10-27 12:16:10,970 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-10-27 12:16:10,970 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-10-27 12:16:10,970 INFO L425 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,970 INFO L425 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,971 INFO L425 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,971 INFO L425 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,971 INFO L425 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,971 INFO L425 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:16:10,971 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-10-27 12:16:10,971 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-10-27 12:16:10,971 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-10-27 12:16:10,971 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-10-27 12:16:10,971 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-10-27 12:16:10,971 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-10-27 12:16:10,972 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-10-27 12:16:10,972 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-10-27 12:16:10,972 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-10-27 12:16:10,972 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-10-27 12:16:10,972 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-27 12:16:10,972 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~d~0 4) (= ~z~0 26) (= ~a17~0 1) (= ~c~0 3) (= ~a21~0 1) (= ~f~0 6) (= 15 ~a8~0) (= ~w~0 23) (= ~u~0 21) (= ~v~0 22) (= ~a7~0 0) (= ~y~0 25) (= ~e~0 5) (= ~x~0 24) (= ~b~0 2) (= ~a~0 1) (= ~a12~0 8) (= ~a20~0 1) (= ~a16~0 5)) [2018-10-27 12:16:10,972 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-27 12:16:10,972 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-27 12:16:10,973 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (and (= ~a21~0 1) (= ~a17~0 1) (= 15 ~a8~0) (= ~a7~0 0) (= ~a20~0 1) (= ~a16~0 5)) (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-10-27 12:16:10,973 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-10-27 12:16:10,973 INFO L421 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse0 (<= ~a20~0 0))) (or (and (not (= ~a16~0 6)) .cse0 (not (= ~a8~0 13))) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (and (not (= ~a7~0 1)) (= 15 ~a8~0) .cse0) (not (= ~y~0 25)) (and .cse0 (<= ~a16~0 4)) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (not (= 0 |old(~a7~0)|)) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (= |old(~a20~0)| ~a20~0) (not (= ~a~0 1)) (not (= |old(~a17~0)| 1)) (not (= |old(~a8~0)| 15)) (not (= 6 ~f~0)))) [2018-10-27 12:16:10,973 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-10-27 12:16:10,973 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-10-27 12:16:10,973 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-10-27 12:16:10,974 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse0 (<= ~a20~0 0))) (or (and (not (= ~a16~0 6)) .cse0 (not (= ~a8~0 13))) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (and (not (= ~a7~0 1)) (= 15 ~a8~0) .cse0) (not (= ~y~0 25)) (and .cse0 (<= ~a16~0 4)) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (not (= 0 |old(~a7~0)|)) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (= |old(~a20~0)| ~a20~0) (not (= ~a~0 1)) (not (= |old(~a17~0)| 1)) (not (= |old(~a8~0)| 15)) (not (= 6 ~f~0)))) [2018-10-27 12:16:10,974 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-10-27 12:16:10,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 12:16:10 BoogieIcfgContainer [2018-10-27 12:16:10,988 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 12:16:10,989 INFO L168 Benchmark]: Toolchain (without parser) took 73907.97 ms. Allocated memory was 1.5 GB in the beginning and 3.7 GB in the end (delta: 2.2 GB). Free memory was 1.4 GB in the beginning and 2.6 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-10-27 12:16:10,990 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 12:16:10,991 INFO L168 Benchmark]: CACSL2BoogieTranslator took 722.62 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-27 12:16:10,992 INFO L168 Benchmark]: Boogie Procedure Inliner took 213.85 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 746.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -819.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. [2018-10-27 12:16:10,993 INFO L168 Benchmark]: Boogie Preprocessor took 81.14 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 12:16:10,993 INFO L168 Benchmark]: RCFGBuilder took 3625.11 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 120.6 MB). Peak memory consumption was 120.6 MB. Max. memory is 7.1 GB. [2018-10-27 12:16:10,994 INFO L168 Benchmark]: TraceAbstraction took 69260.33 ms. Allocated memory was 2.3 GB in the beginning and 3.7 GB in the end (delta: 1.5 GB). Free memory was 2.1 GB in the beginning and 2.6 GB in the end (delta: -475.6 MB). Peak memory consumption was 997.1 MB. Max. memory is 7.1 GB. [2018-10-27 12:16:10,999 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 722.62 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 213.85 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 746.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -819.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 81.14 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3625.11 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 120.6 MB). Peak memory consumption was 120.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 69260.33 ms. Allocated memory was 2.3 GB in the beginning and 3.7 GB in the end (delta: 1.5 GB). Free memory was 2.1 GB in the beginning and 2.6 GB in the end (delta: -475.6 MB). Peak memory consumption was 997.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 548]: 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: (((((((((((((((((((((((!(a16 == 6) && a20 <= 0) && !(a8 == 13)) || !(\old(a21) == 1)) || !(b == 2)) || ((!(a7 == 1) && 15 == a8) && a20 <= 0)) || !(y == 25)) || (a20 <= 0 && a16 <= 4)) || !(x == 24)) || !(a12 == 8)) || !(e == 5)) || !(d == 4)) || !(21 == u)) || !(22 == v)) || !(z == 26)) || !(\old(a16) == 5)) || !(0 == \old(a7))) || !(3 == c)) || !(\old(a20) == 1)) || !(23 == w)) || \old(a20) == a20) || !(a == 1)) || !(\old(a17) == 1)) || !(\old(a8) == 15)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. SAFE Result, 69.1s OverallTime, 10 OverallIterations, 5 TraceHistogramMax, 51.2s AutomataDifference, 0.0s DeadEndRemovalTime, 3.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 1519 SDtfs, 6244 SDslu, 1268 SDs, 0 SdLazy, 8190 SolverSat, 1179 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.7s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 1600 GetRequests, 1464 SyntacticMatches, 10 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 773 ImplicationChecksByTransitivity, 7.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4133occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.4s AbstIntTime, 4 AbstIntIterations, 3 AbstIntStrong, 0.9975972570013266 AbsIntWeakeningRatio, 0.2 AbsIntAvgWeakeningVarsNumRemoved, 12.071794871794872 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 10 MinimizatonAttempts, 487 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 168 PreInvPairs, 250 NumberOfFragments, 809 HoareAnnotationTreeSize, 168 FomulaSimplifications, 6579 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 7 FomulaSimplificationsInter, 3338 FormulaSimplificationTreeSizeReductionInter, 2.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 2239 NumberOfCodeBlocks, 2172 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2685 ConstructedInterpolants, 0 QuantifiedInterpolants, 1457172 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1010 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 14 InterpolantComputations, 7 PerfectInterpolantSequences, 1246/1430 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...