java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label00_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 08:20:32,244 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 08:20:32,247 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 08:20:32,259 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 08:20:32,260 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 08:20:32,260 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 08:20:32,262 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 08:20:32,263 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 08:20:32,265 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 08:20:32,266 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 08:20:32,267 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 08:20:32,267 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 08:20:32,268 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 08:20:32,269 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 08:20:32,273 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 08:20:32,274 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 08:20:32,275 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 08:20:32,276 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 08:20:32,278 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 08:20:32,279 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 08:20:32,280 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 08:20:32,281 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 08:20:32,283 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 08:20:32,283 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 08:20:32,284 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 08:20:32,284 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 08:20:32,285 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 08:20:32,286 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 08:20:32,287 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 08:20:32,288 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 08:20:32,288 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 08:20:32,288 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 08:20:32,289 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 08:20:32,289 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 08:20:32,290 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 08:20:32,290 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 08:20:32,291 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-11-07 08:20:32,305 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 08:20:32,305 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 08:20:32,306 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 08:20:32,306 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 08:20:32,306 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 08:20:32,306 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 08:20:32,307 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-07 08:20:32,307 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 08:20:32,307 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 08:20:32,307 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 08:20:32,307 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 08:20:32,308 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 08:20:32,308 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 08:20:32,308 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 08:20:32,309 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 08:20:32,309 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 08:20:32,309 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 08:20:32,309 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 08:20:32,309 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 08:20:32,310 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 08:20:32,310 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 08:20:32,310 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 08:20:32,310 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 08:20:32,310 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 08:20:32,311 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 08:20:32,311 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 08:20:32,311 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 08:20:32,311 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 08:20:32,311 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 08:20:32,312 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 08:20:32,312 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 08:20:32,312 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 08:20:32,312 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 08:20:32,312 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 08:20:32,313 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 08:20:32,313 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 08:20:32,370 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 08:20:32,388 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 08:20:32,392 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 08:20:32,394 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 08:20:32,394 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 08:20:32,396 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label00_true-unreach-call.c [2018-11-07 08:20:32,458 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9ad1cc30/1d4357313a274b7c85bc36b1f1e0d859/FLAG8d50d42e3 [2018-11-07 08:20:32,979 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 08:20:32,980 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label00_true-unreach-call.c [2018-11-07 08:20:32,992 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9ad1cc30/1d4357313a274b7c85bc36b1f1e0d859/FLAG8d50d42e3 [2018-11-07 08:20:33,007 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9ad1cc30/1d4357313a274b7c85bc36b1f1e0d859 [2018-11-07 08:20:33,018 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 08:20:33,020 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 08:20:33,021 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 08:20:33,021 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 08:20:33,025 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 08:20:33,025 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:20:33" (1/1) ... [2018-11-07 08:20:33,028 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68185dec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:33, skipping insertion in model container [2018-11-07 08:20:33,029 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:20:33" (1/1) ... [2018-11-07 08:20:33,039 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 08:20:33,098 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 08:20:33,589 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 08:20:33,594 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 08:20:33,707 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 08:20:33,723 INFO L193 MainTranslator]: Completed translation [2018-11-07 08:20:33,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:33 WrapperNode [2018-11-07 08:20:33,724 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 08:20:33,725 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 08:20:33,725 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 08:20:33,725 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 08:20:33,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:33" (1/1) ... [2018-11-07 08:20:33,836 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:33" (1/1) ... [2018-11-07 08:20:33,844 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 08:20:33,844 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 08:20:33,844 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 08:20:33,845 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 08:20:33,858 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:33" (1/1) ... [2018-11-07 08:20:33,858 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:33" (1/1) ... [2018-11-07 08:20:33,866 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:33" (1/1) ... [2018-11-07 08:20:33,871 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:33" (1/1) ... [2018-11-07 08:20:33,939 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:33" (1/1) ... [2018-11-07 08:20:33,951 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:33" (1/1) ... [2018-11-07 08:20:33,957 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:33" (1/1) ... [2018-11-07 08:20:33,967 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 08:20:33,968 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 08:20:33,968 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 08:20:33,968 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 08:20:33,969 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 08:20:34,041 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 08:20:34,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 08:20:34,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 08:20:34,042 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 08:20:34,042 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 08:20:34,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 08:20:34,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 08:20:34,042 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 08:20:34,043 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 08:20:37,012 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 08:20:37,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:20:37 BoogieIcfgContainer [2018-11-07 08:20:37,013 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 08:20:37,015 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 08:20:37,015 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 08:20:37,020 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 08:20:37,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:20:33" (1/3) ... [2018-11-07 08:20:37,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74bd021b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:20:37, skipping insertion in model container [2018-11-07 08:20:37,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:33" (2/3) ... [2018-11-07 08:20:37,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74bd021b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:20:37, skipping insertion in model container [2018-11-07 08:20:37,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:20:37" (3/3) ... [2018-11-07 08:20:37,024 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label00_true-unreach-call.c [2018-11-07 08:20:37,037 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 08:20:37,050 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 08:20:37,070 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 08:20:37,116 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 08:20:37,116 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 08:20:37,117 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 08:20:37,117 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 08:20:37,117 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 08:20:37,117 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 08:20:37,118 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 08:20:37,118 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 08:20:37,153 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-11-07 08:20:37,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-07 08:20:37,164 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 08:20:37,166 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] [2018-11-07 08:20:37,168 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 08:20:37,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 08:20:37,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1416877404, now seen corresponding path program 1 times [2018-11-07 08:20:37,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 08:20:37,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 08:20:37,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 08:20:37,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 08:20:37,232 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 08:20:37,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 08:20:37,637 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 08:20:37,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 08:20:37,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 08:20:37,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 08:20:37,743 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 08:20:37,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 08:20:37,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 08:20:37,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 08:20:37,768 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 3 states. [2018-11-07 08:20:39,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 08:20:39,171 INFO L93 Difference]: Finished difference Result 574 states and 992 transitions. [2018-11-07 08:20:39,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 08:20:39,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-11-07 08:20:39,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 08:20:39,192 INFO L225 Difference]: With dead ends: 574 [2018-11-07 08:20:39,192 INFO L226 Difference]: Without dead ends: 356 [2018-11-07 08:20:39,200 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 08:20:39,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-11-07 08:20:39,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2018-11-07 08:20:39,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-11-07 08:20:39,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 609 transitions. [2018-11-07 08:20:39,283 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 609 transitions. Word has length 54 [2018-11-07 08:20:39,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 08:20:39,284 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 609 transitions. [2018-11-07 08:20:39,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 08:20:39,284 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 609 transitions. [2018-11-07 08:20:39,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-07 08:20:39,302 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 08:20:39,303 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 08:20:39,303 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 08:20:39,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 08:20:39,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1936663800, now seen corresponding path program 1 times [2018-11-07 08:20:39,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 08:20:39,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 08:20:39,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 08:20:39,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 08:20:39,308 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 08:20:39,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 08:20:39,680 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 08:20:39,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 08:20:39,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 08:20:39,681 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 08:20:39,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 08:20:39,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 08:20:39,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 08:20:39,684 INFO L87 Difference]: Start difference. First operand 356 states and 609 transitions. Second operand 4 states. [2018-11-07 08:20:41,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 08:20:41,821 INFO L93 Difference]: Finished difference Result 1282 states and 2328 transitions. [2018-11-07 08:20:41,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 08:20:41,825 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2018-11-07 08:20:41,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 08:20:41,835 INFO L225 Difference]: With dead ends: 1282 [2018-11-07 08:20:41,835 INFO L226 Difference]: Without dead ends: 932 [2018-11-07 08:20:41,841 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 08:20:41,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2018-11-07 08:20:41,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 932. [2018-11-07 08:20:41,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 932 states. [2018-11-07 08:20:41,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1469 transitions. [2018-11-07 08:20:41,915 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1469 transitions. Word has length 174 [2018-11-07 08:20:41,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 08:20:41,916 INFO L480 AbstractCegarLoop]: Abstraction has 932 states and 1469 transitions. [2018-11-07 08:20:41,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 08:20:41,917 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1469 transitions. [2018-11-07 08:20:41,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-07 08:20:41,926 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 08:20:41,926 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 08:20:41,927 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 08:20:41,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 08:20:41,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1693717853, now seen corresponding path program 1 times [2018-11-07 08:20:41,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 08:20:41,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 08:20:41,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 08:20:41,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 08:20:41,929 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 08:20:41,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 08:20:42,299 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 08:20:42,608 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 08:20:42,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 08:20:42,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 08:20:42,609 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 08:20:42,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 08:20:42,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 08:20:42,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 08:20:42,611 INFO L87 Difference]: Start difference. First operand 932 states and 1469 transitions. Second operand 6 states. [2018-11-07 08:20:46,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 08:20:46,994 INFO L93 Difference]: Finished difference Result 2162 states and 3509 transitions. [2018-11-07 08:20:46,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 08:20:46,996 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 181 [2018-11-07 08:20:46,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 08:20:47,011 INFO L225 Difference]: With dead ends: 2162 [2018-11-07 08:20:47,012 INFO L226 Difference]: Without dead ends: 1236 [2018-11-07 08:20:47,020 INFO L604 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-11-07 08:20:47,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2018-11-07 08:20:47,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1216. [2018-11-07 08:20:47,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1216 states. [2018-11-07 08:20:47,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 1766 transitions. [2018-11-07 08:20:47,089 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 1766 transitions. Word has length 181 [2018-11-07 08:20:47,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 08:20:47,090 INFO L480 AbstractCegarLoop]: Abstraction has 1216 states and 1766 transitions. [2018-11-07 08:20:47,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 08:20:47,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1766 transitions. [2018-11-07 08:20:47,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-11-07 08:20:47,101 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 08:20:47,101 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 08:20:47,102 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 08:20:47,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 08:20:47,102 INFO L82 PathProgramCache]: Analyzing trace with hash -200482757, now seen corresponding path program 1 times [2018-11-07 08:20:47,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 08:20:47,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 08:20:47,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 08:20:47,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 08:20:47,104 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 08:20:47,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 08:20:47,412 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 08:20:47,495 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 94 proven. 65 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 08:20:47,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 08:20:47,496 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 08:20:47,497 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 252 with the following transitions: [2018-11-07 08:20:47,500 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [333], [335], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [494], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [722], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-07 08:20:47,575 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 08:20:47,575 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 08:20:48,166 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 08:20:48,169 INFO L272 AbstractInterpreter]: Visited 132 different actions 132 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-11-07 08:20:48,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 08:20:48,214 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 08:20:48,765 INFO L227 lantSequenceWeakener]: Weakened 242 states. On average, predicates are now at 73.36% of their original sizes. [2018-11-07 08:20:48,766 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 08:20:49,021 INFO L415 sIntCurrentIteration]: We unified 250 AI predicates to 250 [2018-11-07 08:20:49,021 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 08:20:49,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 08:20:49,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-11-07 08:20:49,023 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 08:20:49,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 08:20:49,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 08:20:49,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 08:20:49,024 INFO L87 Difference]: Start difference. First operand 1216 states and 1766 transitions. Second operand 6 states. [2018-11-07 08:20:59,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 08:20:59,564 INFO L93 Difference]: Finished difference Result 2572 states and 3765 transitions. [2018-11-07 08:20:59,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 08:20:59,565 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 251 [2018-11-07 08:20:59,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 08:20:59,576 INFO L225 Difference]: With dead ends: 2572 [2018-11-07 08:20:59,577 INFO L226 Difference]: Without dead ends: 1362 [2018-11-07 08:20:59,582 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 251 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-07 08:20:59,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2018-11-07 08:20:59,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 1360. [2018-11-07 08:20:59,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1360 states. [2018-11-07 08:20:59,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 1918 transitions. [2018-11-07 08:20:59,619 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 1918 transitions. Word has length 251 [2018-11-07 08:20:59,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 08:20:59,619 INFO L480 AbstractCegarLoop]: Abstraction has 1360 states and 1918 transitions. [2018-11-07 08:20:59,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 08:20:59,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1918 transitions. [2018-11-07 08:20:59,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-11-07 08:20:59,626 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 08:20:59,627 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 08:20:59,627 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 08:20:59,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 08:20:59,628 INFO L82 PathProgramCache]: Analyzing trace with hash 509477615, now seen corresponding path program 1 times [2018-11-07 08:20:59,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 08:20:59,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 08:20:59,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 08:20:59,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 08:20:59,629 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 08:20:59,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 08:20:59,909 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 172 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 08:20:59,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 08:20:59,909 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 08:20:59,909 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 262 with the following transitions: [2018-11-07 08:20:59,910 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [333], [335], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [722], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-07 08:20:59,917 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 08:20:59,917 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 08:21:00,101 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 08:21:00,101 INFO L272 AbstractInterpreter]: Visited 136 different actions 270 times. Merged at 7 different actions 10 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-07 08:21:00,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 08:21:00,127 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 08:21:00,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 08:21:00,128 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 08:21:00,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 08:21:00,145 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 08:21:00,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 08:21:00,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 08:21:00,727 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 172 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 08:21:00,727 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 08:21:01,161 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 172 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 08:21:01,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 08:21:01,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-11-07 08:21:01,196 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 08:21:01,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 08:21:01,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 08:21:01,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-11-07 08:21:01,197 INFO L87 Difference]: Start difference. First operand 1360 states and 1918 transitions. Second operand 9 states. [2018-11-07 08:21:06,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 08:21:06,169 INFO L93 Difference]: Finished difference Result 4356 states and 7058 transitions. [2018-11-07 08:21:06,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 08:21:06,170 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 261 [2018-11-07 08:21:06,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 08:21:06,181 INFO L225 Difference]: With dead ends: 4356 [2018-11-07 08:21:06,181 INFO L226 Difference]: Without dead ends: 1251 [2018-11-07 08:21:06,238 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 543 GetRequests, 525 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2018-11-07 08:21:06,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2018-11-07 08:21:06,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1226. [2018-11-07 08:21:06,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1226 states. [2018-11-07 08:21:06,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1488 transitions. [2018-11-07 08:21:06,298 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1488 transitions. Word has length 261 [2018-11-07 08:21:06,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 08:21:06,299 INFO L480 AbstractCegarLoop]: Abstraction has 1226 states and 1488 transitions. [2018-11-07 08:21:06,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 08:21:06,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1488 transitions. [2018-11-07 08:21:06,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-11-07 08:21:06,307 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 08:21:06,307 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 08:21:06,308 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 08:21:06,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 08:21:06,308 INFO L82 PathProgramCache]: Analyzing trace with hash -42020489, now seen corresponding path program 1 times [2018-11-07 08:21:06,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 08:21:06,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 08:21:06,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 08:21:06,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 08:21:06,313 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 08:21:06,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 08:21:06,662 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 08:21:07,198 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 95 proven. 46 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-07 08:21:07,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 08:21:07,199 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 08:21:07,199 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 298 with the following transitions: [2018-11-07 08:21:07,200 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [333], [335], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [722], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-07 08:21:07,207 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 08:21:07,207 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 08:21:07,536 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 08:21:07,536 INFO L272 AbstractInterpreter]: Visited 135 different actions 264 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 08:21:07,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 08:21:07,574 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 08:21:08,015 INFO L227 lantSequenceWeakener]: Weakened 294 states. On average, predicates are now at 78.22% of their original sizes. [2018-11-07 08:21:08,015 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 08:21:08,809 INFO L415 sIntCurrentIteration]: We unified 296 AI predicates to 296 [2018-11-07 08:21:08,810 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 08:21:08,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 08:21:08,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-11-07 08:21:08,811 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 08:21:08,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 08:21:08,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 08:21:08,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-07 08:21:08,813 INFO L87 Difference]: Start difference. First operand 1226 states and 1488 transitions. Second operand 10 states. [2018-11-07 08:21:36,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 08:21:36,622 INFO L93 Difference]: Finished difference Result 2402 states and 3009 transitions. [2018-11-07 08:21:36,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 08:21:36,623 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 297 [2018-11-07 08:21:36,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 08:21:36,628 INFO L225 Difference]: With dead ends: 2402 [2018-11-07 08:21:36,629 INFO L226 Difference]: Without dead ends: 1326 [2018-11-07 08:21:36,632 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 307 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2018-11-07 08:21:36,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2018-11-07 08:21:36,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 1275. [2018-11-07 08:21:36,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1275 states. [2018-11-07 08:21:36,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 1513 transitions. [2018-11-07 08:21:36,665 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 1513 transitions. Word has length 297 [2018-11-07 08:21:36,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 08:21:36,666 INFO L480 AbstractCegarLoop]: Abstraction has 1275 states and 1513 transitions. [2018-11-07 08:21:36,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 08:21:36,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1513 transitions. [2018-11-07 08:21:36,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2018-11-07 08:21:36,673 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 08:21:36,674 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 08:21:36,674 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 08:21:36,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 08:21:36,675 INFO L82 PathProgramCache]: Analyzing trace with hash 2004825060, now seen corresponding path program 1 times [2018-11-07 08:21:36,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 08:21:36,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 08:21:36,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 08:21:36,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 08:21:36,676 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 08:21:36,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 08:21:37,076 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 331 proven. 2 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-07 08:21:37,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 08:21:37,076 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 08:21:37,077 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 371 with the following transitions: [2018-11-07 08:21:37,077 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [333], [335], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [722], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-07 08:21:37,088 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 08:21:37,090 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 08:21:37,276 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 08:21:37,276 INFO L272 AbstractInterpreter]: Visited 137 different actions 407 times. Merged at 8 different actions 20 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 24 variables. [2018-11-07 08:21:37,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 08:21:37,278 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 08:21:37,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 08:21:37,279 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 08:21:37,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 08:21:37,290 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 08:21:37,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 08:21:37,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 08:21:37,509 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 331 proven. 2 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-07 08:21:37,509 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 08:21:37,894 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 331 proven. 2 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-07 08:21:37,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 08:21:37,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-11-07 08:21:37,915 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 08:21:37,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 08:21:37,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 08:21:37,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-07 08:21:37,917 INFO L87 Difference]: Start difference. First operand 1275 states and 1513 transitions. Second operand 6 states. [2018-11-07 08:21:39,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 08:21:39,586 INFO L93 Difference]: Finished difference Result 3449 states and 4220 transitions. [2018-11-07 08:21:39,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 08:21:39,586 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 370 [2018-11-07 08:21:39,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 08:21:39,597 INFO L225 Difference]: With dead ends: 3449 [2018-11-07 08:21:39,597 INFO L226 Difference]: Without dead ends: 2179 [2018-11-07 08:21:39,600 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 754 GetRequests, 741 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-11-07 08:21:39,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2179 states. [2018-11-07 08:21:39,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2179 to 2026. [2018-11-07 08:21:39,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2026 states. [2018-11-07 08:21:39,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2026 states to 2026 states and 2403 transitions. [2018-11-07 08:21:39,652 INFO L78 Accepts]: Start accepts. Automaton has 2026 states and 2403 transitions. Word has length 370 [2018-11-07 08:21:39,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 08:21:39,653 INFO L480 AbstractCegarLoop]: Abstraction has 2026 states and 2403 transitions. [2018-11-07 08:21:39,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 08:21:39,653 INFO L276 IsEmpty]: Start isEmpty. Operand 2026 states and 2403 transitions. [2018-11-07 08:21:39,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2018-11-07 08:21:39,664 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 08:21:39,664 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 08:21:39,664 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 08:21:39,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 08:21:39,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1469628719, now seen corresponding path program 1 times [2018-11-07 08:21:39,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 08:21:39,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 08:21:39,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 08:21:39,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 08:21:39,666 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 08:21:39,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 08:21:40,155 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 344 proven. 2 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-11-07 08:21:40,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 08:21:40,156 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 08:21:40,156 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 384 with the following transitions: [2018-11-07 08:21:40,156 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [333], [335], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [558], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [722], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-07 08:21:40,163 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 08:21:40,167 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 08:21:40,444 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 08:21:40,445 INFO L272 AbstractInterpreter]: Visited 137 different actions 407 times. Merged at 8 different actions 20 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 24 variables. [2018-11-07 08:21:40,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 08:21:40,465 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 08:21:40,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 08:21:40,466 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 08:21:40,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 08:21:40,476 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 08:21:40,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 08:21:40,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 08:21:40,828 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 21 [2018-11-07 08:21:41,190 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2018-11-07 08:21:41,191 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 08:21:41,933 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2018-11-07 08:21:41,954 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 08:21:41,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2018-11-07 08:21:41,954 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 08:21:41,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 08:21:41,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 08:21:41,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-07 08:21:41,955 INFO L87 Difference]: Start difference. First operand 2026 states and 2403 transitions. Second operand 3 states. [2018-11-07 08:21:43,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 08:21:43,570 INFO L93 Difference]: Finished difference Result 4051 states and 4821 transitions. [2018-11-07 08:21:43,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 08:21:43,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 383 [2018-11-07 08:21:43,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 08:21:43,572 INFO L225 Difference]: With dead ends: 4051 [2018-11-07 08:21:43,572 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 08:21:43,576 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 770 GetRequests, 764 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-07 08:21:43,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 08:21:43,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 08:21:43,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 08:21:43,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 08:21:43,577 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 383 [2018-11-07 08:21:43,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 08:21:43,577 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 08:21:43,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 08:21:43,578 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 08:21:43,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 08:21:43,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 08:21:43,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 08:21:43,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 08:21:43,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 08:21:44,122 WARN L179 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 15 [2018-11-07 08:21:44,757 WARN L179 SmtUtils]: Spent 632.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 27 [2018-11-07 08:21:45,358 WARN L179 SmtUtils]: Spent 593.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 46 [2018-11-07 08:21:45,671 WARN L179 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 55 [2018-11-07 08:21:45,858 WARN L179 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 55 [2018-11-07 08:21:45,861 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 08:21:45,861 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a19~0)| ~a19~0) (= |old(~a10~0)| ~a10~0) (= ~a1~0 |old(~a1~0)|)) [2018-11-07 08:21:45,861 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 08:21:45,861 INFO L425 ceAbstractionStarter]: For program point L465(lines 465 572) no Hoare annotation was computed. [2018-11-07 08:21:45,861 INFO L425 ceAbstractionStarter]: For program point L201(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,861 INFO L425 ceAbstractionStarter]: For program point L168(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,861 INFO L425 ceAbstractionStarter]: For program point L135(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,862 INFO L425 ceAbstractionStarter]: For program point L102(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,862 INFO L425 ceAbstractionStarter]: For program point L69(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,862 INFO L425 ceAbstractionStarter]: For program point L36(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,862 INFO L425 ceAbstractionStarter]: For program point L499(lines 499 572) no Hoare annotation was computed. [2018-11-07 08:21:45,862 INFO L425 ceAbstractionStarter]: For program point L301(lines 301 572) no Hoare annotation was computed. [2018-11-07 08:21:45,862 INFO L425 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-11-07 08:21:45,862 INFO L425 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-11-07 08:21:45,862 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-11-07 08:21:45,862 INFO L425 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-11-07 08:21:45,862 INFO L425 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-11-07 08:21:45,862 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-11-07 08:21:45,862 INFO L425 ceAbstractionStarter]: For program point L335(lines 335 572) no Hoare annotation was computed. [2018-11-07 08:21:45,863 INFO L425 ceAbstractionStarter]: For program point L236(lines 236 572) no Hoare annotation was computed. [2018-11-07 08:21:45,863 INFO L425 ceAbstractionStarter]: For program point L534(lines 534 572) no Hoare annotation was computed. [2018-11-07 08:21:45,863 INFO L425 ceAbstractionStarter]: For program point L171(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,863 INFO L425 ceAbstractionStarter]: For program point L138(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,863 INFO L425 ceAbstractionStarter]: For program point L105(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,863 INFO L425 ceAbstractionStarter]: For program point L72(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,863 INFO L425 ceAbstractionStarter]: For program point L39(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,863 INFO L425 ceAbstractionStarter]: For program point L436(lines 436 572) no Hoare annotation was computed. [2018-11-07 08:21:45,863 INFO L425 ceAbstractionStarter]: For program point L403(lines 403 572) no Hoare annotation was computed. [2018-11-07 08:21:45,863 INFO L425 ceAbstractionStarter]: For program point L370(lines 370 572) no Hoare annotation was computed. [2018-11-07 08:21:45,863 INFO L425 ceAbstractionStarter]: For program point L271(lines 271 572) no Hoare annotation was computed. [2018-11-07 08:21:45,864 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-07 08:21:45,864 INFO L425 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-11-07 08:21:45,864 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-11-07 08:21:45,864 INFO L425 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-11-07 08:21:45,864 INFO L425 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-11-07 08:21:45,864 INFO L425 ceAbstractionStarter]: For program point L569(lines 569 572) no Hoare annotation was computed. [2018-11-07 08:21:45,864 INFO L425 ceAbstractionStarter]: For program point L239(lines 239 572) no Hoare annotation was computed. [2018-11-07 08:21:45,864 INFO L425 ceAbstractionStarter]: For program point L504(lines 504 572) no Hoare annotation was computed. [2018-11-07 08:21:45,864 INFO L425 ceAbstractionStarter]: For program point L471(lines 471 572) no Hoare annotation was computed. [2018-11-07 08:21:45,864 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 572) no Hoare annotation was computed. [2018-11-07 08:21:45,864 INFO L425 ceAbstractionStarter]: For program point L174(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,864 INFO L425 ceAbstractionStarter]: For program point L141(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,864 INFO L425 ceAbstractionStarter]: For program point L108(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,865 INFO L425 ceAbstractionStarter]: For program point L75(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,865 INFO L425 ceAbstractionStarter]: For program point L42(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,865 INFO L425 ceAbstractionStarter]: For program point L340(lines 340 572) no Hoare annotation was computed. [2018-11-07 08:21:45,865 INFO L425 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-11-07 08:21:45,865 INFO L425 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-11-07 08:21:45,865 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-11-07 08:21:45,865 INFO L425 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-11-07 08:21:45,865 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-11-07 08:21:45,865 INFO L425 ceAbstractionStarter]: For program point L540(lines 540 572) no Hoare annotation was computed. [2018-11-07 08:21:45,865 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 572) no Hoare annotation was computed. [2018-11-07 08:21:45,865 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 572) no Hoare annotation was computed. [2018-11-07 08:21:45,866 INFO L425 ceAbstractionStarter]: For program point L210(lines 210 572) no Hoare annotation was computed. [2018-11-07 08:21:45,866 INFO L425 ceAbstractionStarter]: For program point L177(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,866 INFO L425 ceAbstractionStarter]: For program point L111(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,866 INFO L425 ceAbstractionStarter]: For program point L144-1(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,866 INFO L425 ceAbstractionStarter]: For program point L78(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,866 INFO L425 ceAbstractionStarter]: For program point L45(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,866 INFO L425 ceAbstractionStarter]: For program point L442(lines 442 572) no Hoare annotation was computed. [2018-11-07 08:21:45,866 INFO L425 ceAbstractionStarter]: For program point L277(lines 277 572) no Hoare annotation was computed. [2018-11-07 08:21:45,866 INFO L425 ceAbstractionStarter]: For program point L244(lines 244 572) no Hoare annotation was computed. [2018-11-07 08:21:45,866 INFO L425 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-11-07 08:21:45,867 INFO L425 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-11-07 08:21:45,867 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-11-07 08:21:45,867 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-11-07 08:21:45,867 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-11-07 08:21:45,867 INFO L425 ceAbstractionStarter]: For program point L509(lines 509 572) no Hoare annotation was computed. [2018-11-07 08:21:45,867 INFO L425 ceAbstractionStarter]: For program point L476(lines 476 572) no Hoare annotation was computed. [2018-11-07 08:21:45,867 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 572) no Hoare annotation was computed. [2018-11-07 08:21:45,867 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 572) no Hoare annotation was computed. [2018-11-07 08:21:45,867 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 572) no Hoare annotation was computed. [2018-11-07 08:21:45,868 INFO L425 ceAbstractionStarter]: For program point L180(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,868 INFO L425 ceAbstractionStarter]: For program point L147(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,868 INFO L425 ceAbstractionStarter]: For program point L114(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,868 INFO L425 ceAbstractionStarter]: For program point L81(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,868 INFO L425 ceAbstractionStarter]: For program point L48(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,868 INFO L425 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-11-07 08:21:45,868 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-11-07 08:21:45,868 INFO L425 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-11-07 08:21:45,868 INFO L425 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-11-07 08:21:45,869 INFO L425 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-11-07 08:21:45,869 INFO L425 ceAbstractionStarter]: For program point L545(lines 545 572) no Hoare annotation was computed. [2018-11-07 08:21:45,869 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 572) no Hoare annotation was computed. [2018-11-07 08:21:45,869 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 572) no Hoare annotation was computed. [2018-11-07 08:21:45,869 INFO L425 ceAbstractionStarter]: For program point L249(lines 249 572) no Hoare annotation was computed. [2018-11-07 08:21:45,869 INFO L425 ceAbstractionStarter]: For program point L183(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,869 INFO L425 ceAbstractionStarter]: For program point L150(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,869 INFO L425 ceAbstractionStarter]: For program point L117(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,869 INFO L425 ceAbstractionStarter]: For program point L84(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,869 INFO L425 ceAbstractionStarter]: For program point L51(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,870 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,870 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,870 INFO L425 ceAbstractionStarter]: For program point L514(lines 514 572) no Hoare annotation was computed. [2018-11-07 08:21:45,870 INFO L425 ceAbstractionStarter]: For program point L481(lines 481 572) no Hoare annotation was computed. [2018-11-07 08:21:45,870 INFO L425 ceAbstractionStarter]: For program point L448(lines 448 572) no Hoare annotation was computed. [2018-11-07 08:21:45,870 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 572) no Hoare annotation was computed. [2018-11-07 08:21:45,870 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-07 08:21:45,870 INFO L425 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-11-07 08:21:45,871 INFO L425 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-11-07 08:21:45,871 INFO L425 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-11-07 08:21:45,871 INFO L425 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-11-07 08:21:45,871 INFO L425 ceAbstractionStarter]: For program point L548(lines 548 572) no Hoare annotation was computed. [2018-11-07 08:21:45,871 INFO L425 ceAbstractionStarter]: For program point L383(lines 383 572) no Hoare annotation was computed. [2018-11-07 08:21:45,871 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 572) no Hoare annotation was computed. [2018-11-07 08:21:45,871 INFO L425 ceAbstractionStarter]: For program point L351(lines 351 572) no Hoare annotation was computed. [2018-11-07 08:21:45,871 INFO L425 ceAbstractionStarter]: For program point L186(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,871 INFO L425 ceAbstractionStarter]: For program point L153(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,871 INFO L425 ceAbstractionStarter]: For program point L120(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,872 INFO L425 ceAbstractionStarter]: For program point L87(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,872 INFO L425 ceAbstractionStarter]: For program point L54(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,872 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-11-07 08:21:45,872 INFO L425 ceAbstractionStarter]: For program point L21-1(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,872 INFO L425 ceAbstractionStarter]: For program point L517(lines 517 572) no Hoare annotation was computed. [2018-11-07 08:21:45,872 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 572) no Hoare annotation was computed. [2018-11-07 08:21:45,872 INFO L425 ceAbstractionStarter]: For program point L220(lines 220 572) no Hoare annotation was computed. [2018-11-07 08:21:45,872 INFO L425 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-11-07 08:21:45,872 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-11-07 08:21:45,872 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-11-07 08:21:45,873 INFO L425 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-11-07 08:21:45,873 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-11-07 08:21:45,873 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-11-07 08:21:45,873 INFO L425 ceAbstractionStarter]: For program point L419(lines 419 572) no Hoare annotation was computed. [2018-11-07 08:21:45,873 INFO L425 ceAbstractionStarter]: For program point L320(lines 320 572) no Hoare annotation was computed. [2018-11-07 08:21:45,873 INFO L425 ceAbstractionStarter]: For program point L254(lines 254 572) no Hoare annotation was computed. [2018-11-07 08:21:45,873 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 572) no Hoare annotation was computed. [2018-11-07 08:21:45,873 INFO L425 ceAbstractionStarter]: For program point L189(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,873 INFO L425 ceAbstractionStarter]: For program point L156(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,874 INFO L425 ceAbstractionStarter]: For program point L123(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,874 INFO L425 ceAbstractionStarter]: For program point L90(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,874 INFO L425 ceAbstractionStarter]: For program point L57(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,874 INFO L425 ceAbstractionStarter]: For program point L24(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,874 INFO L425 ceAbstractionStarter]: For program point L487(lines 487 572) no Hoare annotation was computed. [2018-11-07 08:21:45,874 INFO L425 ceAbstractionStarter]: For program point L454(lines 454 572) no Hoare annotation was computed. [2018-11-07 08:21:45,874 INFO L425 ceAbstractionStarter]: For program point L388(lines 388 572) no Hoare annotation was computed. [2018-11-07 08:21:45,874 INFO L425 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-11-07 08:21:45,874 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-11-07 08:21:45,875 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-11-07 08:21:45,875 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-11-07 08:21:45,875 INFO L425 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-11-07 08:21:45,875 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-07 08:21:45,875 INFO L425 ceAbstractionStarter]: For program point L554(lines 554 572) no Hoare annotation was computed. [2018-11-07 08:21:45,875 INFO L425 ceAbstractionStarter]: For program point L323(lines 323 572) no Hoare annotation was computed. [2018-11-07 08:21:45,875 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 20 574) the Hoare annotation is: (let ((.cse2 (= |old(~a19~0)| ~a19~0)) (.cse3 (= |old(~a10~0)| ~a10~0))) (let ((.cse1 (and .cse2 .cse3 (= ~a1~0 |old(~a1~0)|))) (.cse0 (= 1 |old(~a10~0)|))) (and (or (< |old(~a1~0)| 219) .cse0 .cse1) (or .cse1 (= 6 |old(~a19~0)|)) (or .cse1 .cse0 (forall ((v_prenex_1 Int)) (or (< (div (+ v_prenex_1 (- 283353)) 5) (+ |old(~a1~0)| 495231)) (= 0 (mod (+ v_prenex_1 2) 5)) (<= 283353 v_prenex_1) (< 38 v_prenex_1)))) (or (= 0 |old(~a10~0)|) .cse0 (and .cse2 .cse3))))) [2018-11-07 08:21:45,875 INFO L425 ceAbstractionStarter]: For program point L357(lines 357 572) no Hoare annotation was computed. [2018-11-07 08:21:45,876 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 572) no Hoare annotation was computed. [2018-11-07 08:21:45,876 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 572) no Hoare annotation was computed. [2018-11-07 08:21:45,876 INFO L425 ceAbstractionStarter]: For program point L192(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,876 INFO L425 ceAbstractionStarter]: For program point L159(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,876 INFO L425 ceAbstractionStarter]: For program point L126(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,876 INFO L425 ceAbstractionStarter]: For program point L93(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,876 INFO L425 ceAbstractionStarter]: For program point L60(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,876 INFO L425 ceAbstractionStarter]: For program point L27(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,876 INFO L425 ceAbstractionStarter]: For program point L523(lines 523 572) no Hoare annotation was computed. [2018-11-07 08:21:45,876 INFO L425 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-11-07 08:21:45,877 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-11-07 08:21:45,877 INFO L425 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-11-07 08:21:45,877 INFO L425 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-11-07 08:21:45,877 INFO L425 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-11-07 08:21:45,877 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-11-07 08:21:45,877 INFO L425 ceAbstractionStarter]: For program point L557(lines 557 572) no Hoare annotation was computed. [2018-11-07 08:21:45,877 INFO L425 ceAbstractionStarter]: For program point L425(lines 425 572) no Hoare annotation was computed. [2018-11-07 08:21:45,877 INFO L425 ceAbstractionStarter]: For program point L326(lines 326 572) no Hoare annotation was computed. [2018-11-07 08:21:45,877 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 572) no Hoare annotation was computed. [2018-11-07 08:21:45,877 INFO L425 ceAbstractionStarter]: For program point L393(lines 393 572) no Hoare annotation was computed. [2018-11-07 08:21:45,877 INFO L425 ceAbstractionStarter]: For program point L360(lines 360 572) no Hoare annotation was computed. [2018-11-07 08:21:45,878 INFO L425 ceAbstractionStarter]: For program point L195(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,878 INFO L425 ceAbstractionStarter]: For program point L162(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,878 INFO L425 ceAbstractionStarter]: For program point L129(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,878 INFO L425 ceAbstractionStarter]: For program point L96(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,878 INFO L425 ceAbstractionStarter]: For program point L63(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,878 INFO L425 ceAbstractionStarter]: For program point L30(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,878 INFO L425 ceAbstractionStarter]: For program point L526(lines 526 572) no Hoare annotation was computed. [2018-11-07 08:21:45,878 INFO L425 ceAbstractionStarter]: For program point L493(lines 493 572) no Hoare annotation was computed. [2018-11-07 08:21:45,878 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 572) no Hoare annotation was computed. [2018-11-07 08:21:45,879 INFO L425 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-11-07 08:21:45,879 INFO L425 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-11-07 08:21:45,879 INFO L425 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-11-07 08:21:45,879 INFO L425 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-11-07 08:21:45,879 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-11-07 08:21:45,879 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-11-07 08:21:45,879 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 572) no Hoare annotation was computed. [2018-11-07 08:21:45,879 INFO L425 ceAbstractionStarter]: For program point L296(lines 296 572) no Hoare annotation was computed. [2018-11-07 08:21:45,879 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 572) no Hoare annotation was computed. [2018-11-07 08:21:45,879 INFO L425 ceAbstractionStarter]: For program point L198(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,879 INFO L425 ceAbstractionStarter]: For program point L165(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,879 INFO L425 ceAbstractionStarter]: For program point L132(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,879 INFO L425 ceAbstractionStarter]: For program point L99(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,879 INFO L425 ceAbstractionStarter]: For program point L66(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,880 INFO L425 ceAbstractionStarter]: For program point L33(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:21:45,880 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 145) no Hoare annotation was computed. [2018-11-07 08:21:45,880 INFO L425 ceAbstractionStarter]: For program point L529(lines 529 572) no Hoare annotation was computed. [2018-11-07 08:21:45,880 INFO L425 ceAbstractionStarter]: For program point L430(lines 430 572) no Hoare annotation was computed. [2018-11-07 08:21:45,880 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 572) no Hoare annotation was computed. [2018-11-07 08:21:45,880 INFO L425 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-11-07 08:21:45,880 INFO L425 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-11-07 08:21:45,880 INFO L425 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-11-07 08:21:45,880 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-07 08:21:45,880 INFO L425 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-11-07 08:21:45,880 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-11-07 08:21:45,880 INFO L425 ceAbstractionStarter]: For program point L563(lines 563 572) no Hoare annotation was computed. [2018-11-07 08:21:45,880 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 572) no Hoare annotation was computed. [2018-11-07 08:21:45,881 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 572) no Hoare annotation was computed. [2018-11-07 08:21:45,881 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 08:21:45,881 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~a19~0 9) (= ~a10~0 0) (= ~a12~0 0) (= ~a1~0 23) (= ~a4~0 14)) [2018-11-07 08:21:45,881 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 08:21:45,881 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 08:21:45,881 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 576 592) the Hoare annotation is: (or (and (= ~a19~0 9) (= |old(~a10~0)| ~a10~0) (= ~a1~0 |old(~a1~0)|)) (not (= 14 ~a4~0)) (not (= 0 ~a12~0)) (not (= 9 |old(~a19~0)|)) (not (= 23 |old(~a1~0)|)) (not (= 0 |old(~a10~0)|))) [2018-11-07 08:21:45,881 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 576 592) no Hoare annotation was computed. [2018-11-07 08:21:45,881 INFO L421 ceAbstractionStarter]: At program point L590(line 590) the Hoare annotation is: (let ((.cse0 (not (= ~a10~0 1)))) (or (not (= ~a19~0 6)) (not (= 23 |old(~a1~0)|)) (and (not (= 0 ~a10~0)) .cse0) (not (= 0 ~a12~0)) (not (= 9 |old(~a19~0)|)) (not (= 0 |old(~a10~0)|)) (and .cse0 (exists ((v_prenex_1 Int)) (and (not (= 0 (mod (+ v_prenex_1 2) 5))) (<= v_prenex_1 38) (<= (+ ~a1~0 495231) (div (+ v_prenex_1 (- 283353)) 5)) (< v_prenex_1 283353)))) (not (= 14 ~a4~0)) (and (<= 219 ~a1~0) .cse0))) [2018-11-07 08:21:45,881 INFO L425 ceAbstractionStarter]: For program point L590-1(line 590) no Hoare annotation was computed. [2018-11-07 08:21:45,881 INFO L425 ceAbstractionStarter]: For program point L587(line 587) no Hoare annotation was computed. [2018-11-07 08:21:45,882 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 582 591) no Hoare annotation was computed. [2018-11-07 08:21:45,882 INFO L421 ceAbstractionStarter]: At program point L582-3(lines 582 591) the Hoare annotation is: (let ((.cse0 (not (= ~a10~0 1)))) (or (not (= 23 |old(~a1~0)|)) (and (not (= 0 ~a10~0)) .cse0) (not (= 0 ~a12~0)) (not (= 9 |old(~a19~0)|)) (not (= 0 |old(~a10~0)|)) (not (= ~a19~0 6)) (and .cse0 (exists ((v_prenex_1 Int)) (and (not (= 0 (mod (+ v_prenex_1 2) 5))) (<= v_prenex_1 38) (<= (+ ~a1~0 495231) (div (+ v_prenex_1 (- 283353)) 5)) (< v_prenex_1 283353)))) (not (= 14 ~a4~0)) (and (<= 219 ~a1~0) .cse0))) [2018-11-07 08:21:45,882 INFO L425 ceAbstractionStarter]: For program point L582-4(lines 576 592) no Hoare annotation was computed. [2018-11-07 08:21:45,887 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-11-07 08:21:45,888 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-11-07 08:21:45,889 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-11-07 08:21:45,889 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-11-07 08:21:45,894 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-11-07 08:21:45,894 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-11-07 08:21:45,895 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-11-07 08:21:45,895 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-11-07 08:21:45,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:21:45 BoogieIcfgContainer [2018-11-07 08:21:45,898 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 08:21:45,899 INFO L168 Benchmark]: Toolchain (without parser) took 72880.20 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-11-07 08:21:45,900 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 08:21:45,901 INFO L168 Benchmark]: CACSL2BoogieTranslator took 703.86 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-07 08:21:45,901 INFO L168 Benchmark]: Boogie Procedure Inliner took 119.09 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 743.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -833.3 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. [2018-11-07 08:21:45,905 INFO L168 Benchmark]: Boogie Preprocessor took 122.99 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 08:21:45,905 INFO L168 Benchmark]: RCFGBuilder took 3046.06 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: 106.1 MB). Peak memory consumption was 106.1 MB. Max. memory is 7.1 GB. [2018-11-07 08:21:45,906 INFO L168 Benchmark]: TraceAbstraction took 68883.27 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -369.2 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-11-07 08:21:45,913 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 703.86 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 119.09 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 743.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -833.3 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 122.99 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 3046.06 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: 106.1 MB). Peak memory consumption was 106.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 68883.27 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -369.2 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 145]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 582]: Loop Invariant [2018-11-07 08:21:45,923 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-11-07 08:21:45,924 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-11-07 08:21:45,924 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-11-07 08:21:45,924 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-11-07 08:21:45,925 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-11-07 08:21:45,925 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-11-07 08:21:45,925 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-11-07 08:21:45,925 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((!(23 == \old(a1)) || (!(0 == a10) && !(a10 == 1))) || !(0 == a12)) || !(9 == \old(a19))) || !(0 == \old(a10))) || !(a19 == 6)) || (!(a10 == 1) && (\exists v_prenex_1 : int :: ((!(0 == (v_prenex_1 + 2) % 5) && v_prenex_1 <= 38) && a1 + 495231 <= (v_prenex_1 + -283353) / 5) && v_prenex_1 < 283353))) || !(14 == a4)) || (219 <= a1 && !(a10 == 1)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. SAFE Result, 68.7s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 54.7s AutomataDifference, 0.0s DeadEndRemovalTime, 2.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 1150 SDtfs, 4056 SDslu, 708 SDs, 0 SdLazy, 6669 SolverSat, 1518 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 37.9s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 2645 GetRequests, 2571 SyntacticMatches, 7 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2026occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.8s AbstIntTime, 5 AbstIntIterations, 2 AbstIntStrong, 0.9974764808798425 AbsIntWeakeningRatio, 0.09523809523809523 AbsIntAvgWeakeningVarsNumRemoved, 14.461538461538462 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 251 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 112 PreInvPairs, 212 NumberOfFragments, 290 HoareAnnotationTreeSize, 112 FomulaSimplifications, 3223 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 2374 FormulaSimplificationTreeSizeReductionInter, 2.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 2985 NumberOfCodeBlocks, 2985 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 3985 ConstructedInterpolants, 50 QuantifiedInterpolants, 3282957 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1619 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 14 InterpolantComputations, 5 PerfectInterpolantSequences, 3361/3486 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...